US10984152B2 - Simulating quantum systems with quantum computation - Google Patents
Simulating quantum systems with quantum computation Download PDFInfo
- Publication number
- US10984152B2 US10984152B2 US15/720,088 US201715720088A US10984152B2 US 10984152 B2 US10984152 B2 US 10984152B2 US 201715720088 A US201715720088 A US 201715720088A US 10984152 B2 US10984152 B2 US 10984152B2
- Authority
- US
- United States
- Prior art keywords
- quantum
- qpus
- unentangled
- models
- fragments
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active, expires
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16C—COMPUTATIONAL CHEMISTRY; CHEMOINFORMATICS; COMPUTATIONAL MATERIALS SCIENCE
- G16C10/00—Computational theoretical chemistry, i.e. ICT specially adapted for theoretical aspects of quantum chemistry, molecular mechanics, molecular dynamics or the like
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N10/40—Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16C—COMPUTATIONAL CHEMISTRY; CHEMOINFORMATICS; COMPUTATIONAL MATERIALS SCIENCE
- G16C20/00—Chemoinformatics, i.e. ICT specially adapted for the handling of physicochemical or structural data of chemical particles, elements, compounds or mixtures
- G16C20/30—Prediction of properties of chemical compounds, compositions or mixtures
Definitions
- phase estimation algorithm and the variational quantum eigensolver have been proposed for solving electronic structure problems on a quantum computer.
- FIG. 1 is a schematic diagram of an example quantum computing system.
- FIG. 2 is a schematic diagram of an example computing system that includes multiple quantum processor units (QPUs).
- QPUs quantum processor units
- FIG. 3A is a schematic representation of an example quantum system that includes multiple fragments.
- FIG. 3B is a diagram of an example quantum system that includes multiple fragments.
- FIG. 4 is a flow chart showing an example quantum simulation process.
- FIG. 5 is a plot showing the energy-per-site from example calculations.
- FIG. 6 is a table showing data from example calculations.
- FIG. 7 is a pair of plots showing the energy-per-site and error from example calculations.
- a quantum system is simulated.
- quantum computations executed on one or more quantum processor units (QPUs), which may operate in parallel, are used for density matrix embedding calculations.
- the quantum computations can include, for example, a variational quantum eigensolver (VQE) used in a density matrix embedding theory (DMET) algorithm or another type of simulation.
- VQE variational quantum eigensolver
- DMET density matrix embedding theory
- a quantum computer can simulate a quantum system whose Hamiltonian has a larger dimension than that which is provided by the number of qubits available to the quantum computer.
- a hybrid computer system can simulate a quantum system whose Hamiltonian has a larger dimension than that which is provided by the number of qubits available to an individual quantum processor unit (QPU) in the hybrid computer system.
- QPU quantum processor unit
- FIG. 1 is a schematic diagram of an example quantum computer system 100 .
- the example quantum computer system 100 shown in FIG. 1 includes a control system 110 , signal delivery system 106 , and a quantum information processor 102 .
- a quantum computing system may include additional or different features, and the components of a quantum computing system may operate as described with respect to FIG. 1 or in another manner.
- the example quantum computer system 100 shown in FIG. 1 can perform quantum computational tasks (such as, for example, quantum simulations or other quantum computational tasks) by executing quantum algorithms.
- the quantum computer system 100 can perform quantum computation by storing and manipulating information within individual quantum states of a composite quantum system.
- qubits i.e., quantum bits
- quantum bits can be stored in and represented by an effective two-level sub-manifold of a quantum coherent physical system in the quantum information processor 102 .
- the quantum computer system 100 can operate using gate-based models for quantum computing.
- the qubits can be initialized in an initial state, and a quantum logic circuit comprised of a series of quantum logic gates can be applied to transform the qubits and extract measurements representing the output of the quantum computation.
- the quantum computing system 100 can operate as a quantum annealer or another type of system that uses an adiabatic model for quantum computing.
- the qubits can be initialized in an initial state, and the controlling Hamiltonian can be transformed adiabatically by adjusting control parameters to another state that can be measured to obtain an output of the quantum computation.
- the example quantum information processor 102 shown in FIG. 1 may be implemented, for example, as a superconducting quantum integrated circuit that includes qubit devices.
- the qubit devices may be used to store and process quantum information, for example, by operating as ancilla qubits, data qubits or other types of qubits in a quantum algorithm.
- Coupler devices in the superconducting quantum integrated circuit may be used to perform quantum logic operations on single qubits or conditional quantum logic operations on multiple qubits.
- the conditional quantum logic can be performed in a manner that allows large-scale entanglement within the quantum information processor 102 .
- Control signals may be delivered to the superconducting quantum integrated circuit, for example, to manipulate the quantum states of individual qubits and the joint states of multiple qubits.
- information can be read from the superconducting quantum integrated circuit by measuring the quantum states of the qubit devices.
- the quantum information processor 102 may be implemented using another type of physical system.
- the example quantum information processor 102 can be maintained in a controlled cryogenic environment.
- the environment can be provided, for example, by shielding equipment, cryogenic equipment, and other types of environmental control systems.
- the components in the quantum information processor 102 operate in a cryogenic temperature regime and are subject to very low electromagnetic and thermal noise.
- magnetic shielding can be used to shield the system components from stray magnetic fields
- optical shielding can be used to shield the system components from optical noise
- thermal shielding and cryogenic equipment can be used to maintain the system components at controlled temperature, etc.
- the signal delivery system 106 provides communication between the control system 110 and the quantum information processor 102 .
- the signal delivery system 106 can receive control signals from the control system 110 and deliver the control signals to the quantum information processor 102 .
- the signal delivery system 106 performs preprocessing, signal conditioning, or other operations to the control signals before delivering them to the quantum information processor 102 .
- the signal delivery system 106 includes connectors or other hardware elements that transfer signals between the quantum information processor and the control system 110 .
- the connection hardware can include signal lines, signal processing hardware, filters, feedthrough devices (e.g., light-tight feedthroughs, etc.), and other types of components.
- the connection hardware can span multiple different temperature and noise regimes.
- the connection hardware can include a series of temperature stages that decrease between a higher temperature regime (e.g., at the control system 110 ) and a lower temperature regime (e.g., at the quantum information processor 102 ).
- the control system 110 controls operation of the quantum information processor 102 .
- the example control system 110 may include data processors, signal generators, interface components and other types of systems or subsystems. Components of the example control system 110 may operate in a room temperature regime, an intermediate temperature regime, or both. For example, the control system 110 can be configured to operate at much higher temperatures and be subject to much higher levels of noise than are present in the environment of the quantum information processor 102 .
- the control system 110 includes a classical computing system that executes software to compile instructions for the quantum information processor 102 .
- the control system 110 may decompose a quantum logic circuit or quantum computing program into discrete control operations or sets of control operations that can be executed by the hardware in the quantum information processor 102 .
- the control system 110 applies a quantum logic circuit by generating signals that cause the qubit devices and other devices in the quantum information processor 102 to execute operations.
- the operations may correspond to single-qubit gates, two-qubit gates, qubit measurements, etc.
- the control system 110 can generate control signals that are communicated to the quantum information processor 102 by the signal delivery system 106 , and the devices in the quantum information processor 102 can execute the operations in response to the control signals.
- the control system 110 includes one or more classical computers or classical computing components that produce a control sequence, for instance, based on a quantum computer program to be executed.
- a classical processor may convert a quantum computer program (e.g., instructions written in the Quil programming language) to an instruction set for the native gate set or architecture of the quantum information processor 102 .
- the control system 110 includes a microwave signal source (e.g., an arbitrary waveform generator), a bias signal source (e.g., a direct current source) and other components that generate control signals to be delivered to the quantum information processor 102 .
- the control signals may be generated based on a control sequence provided, for instance, by a classical processor in the control system 110 .
- the example control system 110 may include conversion hardware that digitizes response signals received from the quantum information processor 102 .
- the digitized response signals may be provided, for example, to a classical processor in the control system 110 .
- the quantum computer system 100 includes multiple quantum information processors 102 that operate as respective quantum processor units (QPU).
- each QPU can operate independent of the others.
- the quantum computer system 100 may be configured to operate according to a distributed quantum computation model, or the quantum computer system 100 may utilize multiple QPUs in another manner.
- the quantum computer system 100 includes multiple control systems, and each QPU may be controlled by a dedicated control system.
- a single control system can control multiple QPUs; for instance, the control system 110 may include multiple domains that each control a respective QPU.
- the quantum computer system 100 uses multiple QPUs to execute multiple unentangled quantum computations (e.g., multiple variational quantum eigensolvers) that collectively simulate a single quantum mechanical system.
- the unentangled quantum computations may collectively perform part of a density matrix embedding calculation, and multiple variational quantum eigensolvers may be used to simulate respective fragments in the density matrix embedding calculation.
- FIG. 2 is a schematic diagram of an example computer system 200 that includes multiple quantum processor units (QPUs).
- the example computer system 200 may be implemented as a distributed computing system, for example, with QPUs operating in disparate locations; or the QPUs may operate in proximity to each other, for example, in a common facility or structure.
- the example computer system 200 shown in FIG. 2 includes one or more classical processor unit(s) 201 communicably connected with eight quantum processor units 202 A, 202 B, 202 C, 202 D, 202 E, 202 F, 202 G, 202 H (collectively, the “QPUs 202 ”).
- the example computer system 200 may include another number of QPUs (e.g., less than eight, or tens or hundreds of them).
- the classical processor unit(s) 201 communicate with the QPUs 202 through the respective interfaces 204 A, 204 B, 204 C, 204 D, 204 E, 204 F, 204 G, 204 H (collectively, the “interfaces 204 ”).
- the computer system 200 may include additional or different components, and the components may be arranged as shown in FIG. 2 or in another manner.
- the classical processor unit(s) 201 may be implemented using various types of classical computational resource, for example, one or more general purpose microprocessors that can run applications and programs by executing or interpreting software, scripts, functions, executables, and other types of computer program code.
- the classical processor unit(s) 201 can be implemented on a dedicated chip or chipset, or it can be integrated with other devices on a shared chip.
- the classical processor unit(s) 201 can be or include a single-core processor, a multi-core processor that includes multiple processing units, or one or more commercially-available products.
- One or more of the classical processor unit(s) 201 may operate as a host device that can control operation of the QPUs 202 .
- the host device can operate as a master device that delegates processing tasks to the QPUs and controls timing and dataflow in the computer system 200 .
- the host device may identify QPUs to execute individual sub-processes in an algorithm (e.g., executions of a VQE in a DMET algorithm), and the host device may delegate the sub-process to the QPUs, for instance, by sending associated instructions to the respective QPUs.
- the sub-process delegated to each QPU represents a particular sub-problem of a large quantum system that is being simulated in the computer system 200 ; the sub-problems can be computed by the QPUs and then reintegrated into the total solution by the classical processor unit(s) 201 .
- the classical processor unit(s) 201 may provide sub-problems that have been constructed according to density matrix embedding theory (DMET).
- the QPUs can operate as specialized processors that are configured to supplement functionality of the classical processor unit(s) 201 , for example, in simulations of quantum systems.
- a co-processor can include hardware, firmware, or other features configured to execute a class of operations or a class of functions faster or otherwise more efficiently than the main processor.
- the computer system 200 includes the QPUs 202 and multiple other distinct types of computing modules, such as, for example, FPGAs, application-specific integrated circuits (ASICs), systems-on-chip (SoCs) or other processor devices. Operation of the QPUs and other devices can be supervised or otherwise controlled by one or more of the classical processor unit(s) 201 .
- Each of the example QPUs 202 includes qubit devices that define the computational state of that QPU.
- the QPUs 202 operate as unentangled units, which means that none of the QPUs 202 becomes entangled with any of the other QPUs 202 during operation of the computer system 200 .
- the QPU 202 A does not become entangled with any of the other QPUs 202 B, 202 C, 202 D, 202 E, 202 F, 202 G, 202 H during operation of the computer system 200 .
- qubit devices within the same QPU can become entangled with each other, qubit devices not within the same QPU cannot become entangled with each other during operation of the example computer system 200 .
- each QPU 202 can include any type of data processing hardware device that can encode and process information in quantum states of light or matter.
- QPUs can be configured to execute quantum algorithms that perform certain computational tasks more efficiently than other types of processors.
- Some QPUs can be configured to implement a variational quantum eigensolver (VQE), perform a Fourier transform, factor large integers (e.g., Shor's algorithm), simulate a quantum system, perform a search (e.g., Grover's algorithm), estimate quantum phases, or other types of computational tasks.
- VQE variational quantum eigensolver
- QPUs are configured to perform these and other types of operations by leveraging large-scale entanglement and other quantum resources.
- one or more of the QPUs 202 includes a superconducting circuit, and the qubit devices are implemented as circuit devices that include Josephson junctions, for example, in superconducting quantum interference device (SQUID) loops or other arrangements, and are controlled by radio-frequency signals, microwave signals, and bias signals delivered to the quantum processor cell 102 .
- one or more of the QPUs 202 includes an ion trap system, and the qubit devices are implemented as trapped ions controlled by optical signals delivered to the system.
- one or more of the QPUs 202 includes a spin system, and the qubit devices are implemented as nuclear or electron spins controlled by microwave or radio-frequency signals delivered to the system.
- the QPUs 202 may be implemented based on another physical modality of quantum computing.
- one or more of the classical processor unit(s) 201 accesses a computer program to be executed in the computer system 200 .
- the computer program can include computer program code that defines variables and data processing tasks (e.g., functions, routines, etc.).
- the computer program can be executed in the computer system 200 by delegating data processing tasks to the various processor devices.
- the data processing tasks may be delegated in series, in parallel, or both, as specified by the computer program or other protocols.
- the classical processor unit(s) 201 may delegate computational tasks to the QPUs 202 in series, in parallel, as the QPUs 202 become available, or otherwise.
- instructions generated by the classical processor unit(s) 201 are configured to cause one of the QPUs 202 to perform a particular function or other data processing task defined in the computer program.
- the instructions are provided to the QPU 202 through the appropriate interface 204 , and the QPU 202 performs the data processing task by executing the instructions generated by the classical processor unit(s) 201 .
- Output values generated by the QPU can then be provided back to the classical processor unit(s) 201 through the interface 204 .
- the classical processor unit(s) 201 can then execute or delegate further operations in the computer program based on the output values from the QPU.
- the computer program (which may also be called a program, script, or code) includes computer program code that can be written in any form of programming language, including compiled or interpreted languages, declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, object, or other unit suitable for use in the computer system 200 .
- a computer program may, but need not, correspond to a file in a file system.
- a program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code).
- the interfaces 204 can include, for example, connectors, wires, cables, communication interfaces, networks or other systems or components to transfer information between the classical processor unit(s) 201 and the respective QPUs 202 .
- the interfaces 204 are implemented as all or part of the signal delivery system 106 in FIG. 1 .
- the interfaces 204 may connect the respective QPUs 202 to a control system that includes the classical processor unit(s) 201 .
- the interfaces 204 may include one or more wired or wireless connections, or one or more wired or wireless networks or other communication channels.
- the classical processor unit(s) 201 may communicate with the respective QPUs 202 over one or more public or private networks (a Local Area Network (LAN), a Wide Area Network (WAN), a Virtual Private Network (VPN), the Internet, a peer-to-peer network, a cellular network, a Wi-Fi network, or another type of data network).
- LAN Local Area Network
- WAN Wide Area Network
- VPN Virtual Private Network
- the Internet a peer-to-peer network, a cellular network, a Wi-Fi network, or another type of data network.
- the computer system 200 simulates a quantum system.
- the computer system 200 may perform the quantum simulation process 400 shown in FIG. 4 , or the computer system 200 may simulate a quantum system in another manner.
- the computer system 200 utilizes the QPUs 202 in a simulation that executes a density matrix embedding theory (DMET) algorithm.
- DMET density matrix embedding theory
- a wide variety of Hamiltonians and quantum systems can be simulated using DMET algorithms.
- the accuracy of a DMET algorithm generally increases with larger fragment sizes, and utilizing the QPUs 202 may increase the size of fragments that can be simulated in the DMET algorithm.
- calculations can be accelerated for faster simulation times.
- the classical processor unit(s) 201 parameterizes a quantum algorithm for execution by a QPU based on the hardware and performance capabilities of the particular QPUs 202 that are available in the system 200 .
- the classical processor unit(s) 201 identifies fragments for simulation by particular QPU hardware resources.
- each of the QPUs may have a different number of qubits available, with the i-th QPU having N i -qubit computational power.
- the classical processor unit(s) 201 may define fragments that utilize the full computing power of each QPU.
- the classical processor unit(s) 201 can identify fragments having a dimension that is matched to the computing resources (e.g., number of qubits) of each respective QPU.
- FIG. 3A is a schematic representation of an example quantum system 300 that includes multiple fragments.
- the quantum system 300 can be, for example, a large N-body quantum system that has been discretized into ‘r’ distinct fragments.
- Each fragment may represent a quantum subsystem within the total quantum system 300 ; for example, the portion labeled F 1 , includes part of the total quantum system 300 and may be referred to as a fragment.
- a fragment may represent any subspace within a Hilbert space defined by the quantum system 300 .
- none of the fragments overlaps another fragment in the quantum system 300 , and the fragments collectively constitute the entire quantum system 300 .
- each fragment corresponds to a subset of bodies or properties (e.g., spins, electrons, photons, nuclei, protons, neutrons, etc.) within a quantum system, or a fragment may correspond to another type of quantum subsystem within the larger quantum system.
- the fragments can be defined based on a type of problem to be solved by a simulation of the quantum system; chemical, structural or physical properties of the quantum system; or other considerations.
- FIG. 3B is a diagram of an example quantum system 310 that includes multiple fragments.
- the example quantum system 310 shown in FIG. 3B is a single caffeine molecule.
- the caffeine molecule is an arrangement of hydrogen atoms, carbon atoms, nitrogen atoms, and oxygen atoms.
- a discretization process has identified four fragments in the quantum system 310 ; the fragments, labeled ‘A’, ‘B’, ‘C’, and ‘D’ are of unequal sizes.
- each fragment corresponds to a region containing bonded atomic species within the structure of the caffeine molecule.
- FIG. 4 is a flow chart showing an example quantum simulation process 400 .
- the process 400 performs a density matrix embedding procedure that is executed using variational quantum eigensolvers (VQEs) running on one or several quantum computing systems or QPUs.
- VQEs variational quantum eigensolvers
- the process 400 may represent another type of simulation procedure.
- the example process 400 shown in FIG. 4 may include additional or different operations, and the operations may be performed in the order shown or in another order.
- an individual operation in the process 400 may be implemented as one or more sub-processes, or multiple operations in the process 400 may be performed in parallel or implemented together as a single sub-process.
- operations are repeated in an iterative fashion, for example, until a terminating condition is reached.
- the example process 400 can be used to simulate a quantum system.
- the quantum system to be simulated is a sub-atomic, atomic or molecular system.
- the quantum system to be simulated can be all or part of the caffeine molecule shown in FIG. 3B .
- the quantum system is one- or two-dimensional lattice model, an extended chemical system, or a ground state or transition state molecule.
- the process 400 can be used to simulate a black hole event horizon, an open quantum system coupled to an environment, a topological quantum computer, or a quantum annealer. Other types of systems may be simulated by the example process 400 .
- the example process 400 can be executed by a computer system that includes one or more quantum processor units (QPUs) and possibly additional processor units.
- QPUs quantum processor units
- the process 400 may be executed by the quantum computer system 100 shown in FIG. 1 , the computer system 200 shown in FIG. 2 or another type of computer system.
- a classical processor unit in the computer system runs the process 400 and uses one or more QPUs to perform certain operations.
- a classical processor unit may use a QPU to perform an operation by sending instructions to the QPU.
- the classical processor unit may use other types of processors as well (e.g., a graphics processing unit (GPU), a cryptographic co-processor, or another type of classical co-processor).
- GPU graphics processing unit
- cryptographic co-processor or another type of classical co-processor
- a quantum system is simulated by operating a set of models on a computer system that includes a classical processor unit and a plurality of unentangled quantum processor units (QPUs).
- the classical processor unit operates a low-level quantum system model (e.g., ⁇ chem or another Hamiltonian), for instance, to compute an approximate ground state at 406 .
- the unentangled QPUs operate high-level quantum subsystem models (e.g., ⁇ emb ⁇ or another set of Hamiltonians), for instance, to compute reduced density matrices (RDMs) for fragments at 410 .
- Multiple subsystem models may be operated in parallel, for example, by using multiple unentangled QPUs concurrently.
- the computer system may operate the set of models in another manner in some cases.
- a server or server cluster has access to several quantum computing systems, where each quantum computing system includes a superconducting microwave quantum circuit that can execute quantum algorithms.
- the server or server cluster includes classical processors (e.g., commercial microprocessors) that perform classical computing operations in the process 400 (e.g., operations 402 , 404 , 406 , 408 , 412 , 414 ) and delegates (at 410 ) quantum computing operations to the quantum computing systems.
- the server or server cluster may communicate with the quantum computing systems, for example, over a Wide Area Network (WAN), a Virtual Private Network (VPN) or another type of network configuration. As such, the server or server cluster may access and utilize quantum computing resources over a large geographic region in some cases.
- WAN Wide Area Network
- VPN Virtual Private Network
- the control system of the quantum computing system compiles QPU-level instructions that cause the superconducting microwave quantum circuit to execute the delegated quantum algorithm. After the quantum computing system generates an output by executing the quantum algorithm, the quantum computing system sends the output to the server or server cluster. The server or server cluster can then process the outputs from multiple quantum computing systems.
- a control system in a quantum computing system has access to several QPUs within the quantum computing system, where each QPU includes a superconducting microwave quantum circuit that can execute quantum algorithms.
- the control system includes classical processors (e.g., commercial microprocessors) that perform classical computing operations in the process 400 (e.g., operations 402 , 404 , 406 , 408 , 412 , 414 ) and identifies (at 410 ) specific QPUs to perform quantum computing operations.
- the control system may be located with the QPUs in a controlled environment, and may communicate with the QPUs, for example, over transmission lines or another type of microwave connection.
- control system When the control system identifies a QPU to execute a quantum algorithm, the control system compiles QPU-level instructions that cause the superconducting microwave quantum circuit of the QPU to execute the quantum algorithm.
- the control system can have multiple quantum algorithms executed by the QPUs, for example, in parallel or in a designated order. The control system can then process the outputs from multiple QPUs.
- fragments of a quantum system are identified.
- the fragments can be identified, for example, by discretizing the quantum system into subparts as shown in FIGS. 3A and 3B , or the fragments may be identified in another manner.
- the fragments can be defined, for instance, by projection operators (e.g., as in Equation (11) or otherwise) or the fragments can be defined in another manner.
- each fragment is a single site (or multiple sites) of a lattice model.
- each fragment is a localized atomic orbital corresponding to a piece of a larger molecular basis set.
- the fragments can be identified based on known attributes of the quantum system being simulated, based on the type or output of the simulation, or based on other information.
- fragments are identified at 402 based on the quantum computing resources available.
- the number of fragments identified may be based on (e.g., less than, equal to, an integer multiple of, etc.) the number of QPUs available.
- the size of the fragments may be based on the size of the QPUs available.
- the process 400 may identify fragments of the largest size that can be simulated by the QPUs available, or the process may identify fragments of multiple sizes matched to the sizes of multiple available QPUs.
- an approximate Hamiltonian of the quantum system is defined.
- An example of an approximate Hamiltonian is the Hamiltonian ⁇ chem shown in Equation (4); in some cases, an approximate Hamiltonian may have another form.
- the approximate Hamiltonian can be or include a quadratic Hamiltonian.
- the approximate Hamiltonian may include the Hartree-Fock Hamiltonian ⁇ circumflex over (F) ⁇ chem shown in Equation (4) below, which may be augmented by additional terms or values.
- the approximate Hamiltonian can include embedding potentials, which may be defined, for example, as the embedding potentials v r,s in Equation (4) below or in another manner.
- the approximate Hamiltonian can also include a global chemical potential in some cases.
- initial values can be assigned to the embedding potentials.
- the initial values assigned to the embedding potentials can be zeros, random values, estimated values, etc.
- initial values are assigned to a global chemical potential in the approximate Hamiltonian as well.
- an approximate ground state of the quantum system is computed.
- the approximate ground state can be computed, for example, by performing a low-level simulation on a classical or quantum processor based on the approximate Hamiltonian.
- the approximate ground state can be, for example, the Slater determinant wave-function
- embedded Hamiltonians are generated for the fragments.
- the embedded Hamiltonians can be generated as described with respect to Equation (16) below, or the embedded Hamiltonians can be generated in another manner.
- each embedded Hamiltonian represents the approximate Hamiltonian rotated or projected onto one of the respective fragments.
- operations 402 , 404 , 406 , 408 generate a set of models that are used to simulate the quantum system.
- the set of models can include a low-level system model for the full quantum system as well as higher-level subsystem models for the respective fragments of the full quantum system.
- the approximate Hamiltonian (e.g., ⁇ chem ) defined at 404 which includes embedding potentials (e.g., v r,s ) associated with the respective fragments, is an example of a low-level system model for the quantum system; and the embedded Hamiltonians (e.g., ⁇ emb ) generated at 408 are examples of quantum subsystem models for the respective fragments.
- Another set of models may be generated for simulating a quantum system, or the example set of models described in the example process 400 may be generated in another manner.
- quantum processor units are used to compute reduced density matrices (RDMs).
- RDMs reduced density matrices
- the 1-reduced density matrix (1-RDM) and 2-reduced density matrix (2-RDM) are computed for each fragment based on the embedded Hamiltonian for the fragment.
- Some or all of the RDMs can be computed concurrently by operating multiple QPUs in parallel.
- two or more of the RDMs are computed at different times, for example, by running two simulations in series on a single QPU.
- the QPUs generate the set of values ⁇ D r,s x ⁇ in Equation (19) below, or the QPUs may produce other types of outputs.
- multiple unentangled QPUs are used at 410 , and a variational quantum eigensolver (VQE) algorithm is executed on each QPU to compute the reduced density matrices (RDMs) for the respective fragments based on the quantum subsystem models.
- VQE variational quantum eigensolver
- one-particle reduced density matrices (1-RDMs), two-particle reduced density matrices (2-RDMs), or both may be computed by the VQE algorithm.
- the embedding potentials in the approximate Hamiltonian are updated.
- an updated set of values for the embedding potentials can be computed based on the RDMs computed (at 410 ) by the QPUs, and the embedding potentials in the approximate Hamiltonian may then be updated (e.g., by assigning the updated set of values to the embedding potential variables in the approximate Hamiltonian).
- the updated set of values can be calculated, for example, using a cost function or another type of minimization function. For instance, the updated set of values may be calculated according to Equation (19) below, or another type of cost function may be used to compute updated values.
- the example simulation process 400 includes an iterative process, and each iteration of the iterative process can include one or more of operations 406 , 408 , 410 , 412 .
- a current iteration of the iterative process may include computing an updated approximate ground state for the current iteration ( 406 ) based on the approximate Hamiltonian (with embedding potentials having been updated on a prior iteration, in some cases); generating updated quantum subsystem models (e.g., updated embedded Hamiltonians) for the current iteration ( 408 ) based on the updated approximate ground state; using the QPUs to compute updated RDMs based on the updated quantum subsystem models ( 410 ); and updating the embedding potentials in the approximate Hamiltonian ( 412 ) based on the updated RDMs.
- updated quantum subsystem models e.g., updated embedded Hamiltonians
- one or more checks are performed at 412 ; the checks may be performed within the sub-process or calculation that updates the embedding potentials, or the checks may be performed by a separate sub-process or calculation, for instance, before or after updating the embedding potentials.
- the RDMs are analyzed to check whether particles are conserved.
- the current values of the embedding potentials are compared to prior values of the embedding potentials to check whether the values have changed (increased or decreased) by more than a threshold (e.g. zero or a non-zero threshold).
- Results of checks or other calculations performed at 412 can determine whether the process 400 returns to 406 (e.g., for another iteration of the iterative process), progresses to 414 , or proceeds in another manner. For example, if it is determined that particles are not conserved, the global chemical potential may be updated, and the process 400 can return to 406 for another iteration. As another example, if the embedding potentials have changed by more than a threshold (e.g. zero or a non-zero threshold), the process 400 can return to 406 for another iteration with the updated values of the embedding potentials. If particles are conserved and the embedding potentials have not changed (e.g., by more than the threshold value), then the process 400 can proceed to 414 . Other types of checks may be performed in some cases.
- a threshold e.g. zero or a non-zero threshold
- the quantum system is analyzed.
- the analysis may include computing an observable or other physical property of the quantum system.
- the observable or other physical property may be computed based on the RDMs generated at 410 (e.g., on the last iteration), based on the approximate Hamiltonian with the updated values assigned to the embedding potentials, or based on other information.
- an approximate ground state energy of the quantum system may be computed from the RDMs computed at 410 .
- Additional or different physical properties of the quantum system e.g., dipole moments, electron polarizability, charge and spin-correlation functions
- ground state energies of quantum systems can be determined by quantum or hybrid classical/quantum techniques. For instance, small-scale devices may be leveraged to identify important subspaces of relatively large Hamiltonians.
- DMET density matrix embedding theory
- VQE variational quantum eigensolver
- the variational quantum eigensolver can be implemented as a hybrid classical/quantum algorithm to approximate the ground state eigenvalues and density matrices of a Hamiltonian.
- the VQE can be implemented as a classical optimization loop invoking a quantum abstract machine (QAM) used for state preparation and operator measurement.
- QAM quantum abstract machine
- VQE using a wavefunction ansatz that is exponentially expensive on a classical computer, such as unitary coupled-cluster or approximate Hamiltonian evolution, offers a potentially advantageous alternative to other high fidelity solvers (e.g., FCI, density matrix renormalization group, etc.) for active space calculations and embedding schemes.
- high fidelity solvers e.g., FCI, density matrix renormalization group, etc.
- the VQE can be integrated into computational chemistry methodologies that utilize a high-fidelity solver with an interface utilizing the one-particle and two-particle reduced density matrices (1-RDM and 2-RDM, respectively).
- DMET Density matrix embedding theory maps the problem of finding the ground state of a large N-particle system onto many interacting impurity problems. This can be achieved by self-consistently matching the 1-RDM from a low-level wavefunction for the entire system with the 1-RDMs of the impurities calculated with a high-level technique. Though it is not necessarily clear that such an iterative scheme would result in accurate local RDMs, DMET has been demonstrated to be highly accurate for one- and two-dimensional lattice models, extended chemical systems, and for ground state and transition state molecules. Furthermore, spectral functions (on the real-frequency axis) are accessible from DMET without any bath discretization error allowing for the construction of arbitrary dynamic correlation functions. These studies demonstrate the amazing quality of DMET with modestly sized impurities.
- DMET algorithms include an embedded problem solver.
- the problem solver produces a high-accuracy 1-RDM for the embedded problem such that the fragment piece of the mean-field 1-RDM can be matched to the correlated 1-RDM for the fragment.
- VQE for the embedded problem solver (as an alternative to FCI or DMRG routines).
- using the VQE as the embedded problem solver potentially allows for (i) the study of a larger embedding Hamiltonian, allowing access to longer range correlation functions, and (ii) accelerating the DMET algorithm by quickly finding the solution to the embedded problem on a quantum computer.
- a fragment For a large system Q, its wavefunction can be arbitrarily bi-partitioned into a fragment (or impurity) and bath (or environment).
- Some examples of a fragment include a single site or multiple sites of a lattice model or localized atomic orbitals corresponding to a piece of a larger molecular basis set.
- ⁇ may be expressed in the tensor product of basis states of the fragment and the bath, ⁇
- an eigenstate of Q can be written as a sum over the tensor products of the Schmidt basis states.
- This Schmidt basis is constructed by the singular value decomposition of the coefficient tensor. This reformulation demonstrates that there is a local fragment basis and environment basis of the same size that produces an equivalent representation of
- ⁇ can be computed approximately.
- the embedded Hamiltonian is approximated by constructing bath states from the Schmidt decomposition of the ground state of an approximate (e.g., quadratic) Hamiltonian for the total system.
- the embedded Hamiltonian now contains an interacting fragment embedded in a non-interacting bath.
- the embedding Hamiltonian may be approximated by matching the fragment's 1-RDM with the low-level mean-field density matrix of the system by varying the embedding potential that appears in the quadratic Hamiltonian.
- the Hamiltonian contains terms that are at most four creation/annihilation operators corresponding to one-and two-particle interactions:
- H ⁇ chem ⁇ i , j 1 ⁇ h i , j ⁇ a ⁇ i ⁇ ⁇ a ⁇ j + 1 2 ⁇ ⁇ ij , kl 2 ⁇ V ij , kl ⁇ a ⁇ i ⁇ ⁇ a ⁇ j ⁇ ⁇ a ⁇ l ⁇ a ⁇ k . ( 3 )
- a potential may be added to the full chemical Hamiltonian.
- the augmented total system Hamiltonian is then approximated using the Hartree-Fock method to find an optimal single-particle basis, for example:
- ⁇ ⁇ 0 ⁇ ( ⁇ p ⁇ ⁇ a ⁇ p ⁇ ) ⁇ ⁇ vac ⁇ ( 9 )
- the single particle orbitals â p ⁇ can be constructed from linear combinations of site orbitals, ⁇ 554 , in the lattice:
- the matrix D corresponds with the Hartree-Fock transform from local lattice spin-orbitals to the basis that minimizes the Hartree-Fock Hamiltonian of the system.
- a rotation to the fragment and bath basis can be constructed in a similar manner to the canonical orthogonalization of atomic orbitals that appears in the Hartree-Fock procedure applied to molecules.
- ⁇ b i ⁇ ⁇ p ⁇ ⁇ V p , i * 1 - ⁇ i ⁇ P ⁇ B ⁇ ⁇ ⁇ p ⁇ . ( 13 )
- the core states with zero overlap on the fragment can be eliminated from the embedded Hamiltonian by including their interaction at the mean-field level similar to generating an active space interacting with a frozen set of core states.
- H ⁇ emb ⁇ p , q ⁇ ⁇ h ⁇ p , q 1 ⁇ a ⁇ p ⁇ ⁇ a ⁇ q + 1 2 ⁇ ⁇ p , q ; r , s ⁇ ⁇ V ⁇ p , q ; r , s 2 ⁇ a ⁇ p ⁇ ⁇ a ⁇ q ⁇ ⁇ a ⁇ s ⁇ a ⁇ r , ( 16 )
- h ⁇ p , q 1 : C ⁇ ⁇ h a , b 1 ⁇ C + f pq core ( 17 )
- 18
- the DMET procedure can include operations to improve the bath states so they approximate the bath states of the true embedded Hamiltonian.
- Schmidt bath state tuning may be achieved by varying the potential that was added to the system Hamiltonian in Equation (4). Variation in this potential can provide a connection between the embedded Hamiltonian and the quadratic Hamiltonian representing the larger quantum system.
- the first, second and third sub-processes can be repeated, for example, until particle conservation and the embedding potential do not change between iterations.
- the third sub-process can be carried out, for instance, by minimizing the squared norm between the fragment piece of the mean-field 1-RDM and the fragment 1-RDM computed from the ground state wavefunction for the embedded Hamiltonian:
- CF frag ⁇ ( u ) ⁇ x ⁇ ⁇ ⁇ r , s ⁇ frag ⁇ ⁇ ( D r , s x - D r , s mf ⁇ ( u ) ) 2 .
- the variable u may represent the embedding potentials v r,s in Equation (4), and least squares minimization or another minimization technique can be used to minimize CF frag with respect to v r,s .
- This cost function is known as the fragment-only density matrix fitting.
- Alternatives such as full matching of the 1-RDMs in the embedding basis or matching the electron densities on the fragment have also been studied.
- the exponentially scaling FCI has prompted studying alternative methods for finding the correlated ground state 1-RDM. Though this may not lead to an optimal approximation to the embedded Hamiltonian fragment and bath states it does allow for the study of significantly larger fragments, which may be important for assessing longer range correlation functions and more accurate local expectation values.
- the ability to study larger fragments at higher fidelity has many implications for accurate simulations of materials and chemistry. For example, if one were studying a reaction center in a metal-organic framework, a fragment would likely contain the metal site and ligand orbitals for an accurate description of the energy and properties.
- the VQE can be used when solving for the 1-RDM and 2-RDM of the embedded Hamiltonian. DMET's use of the 1-RDM of the embedded Hamiltonian makes VQE a suitable algorithm for this use case.
- the VQE provides a functional minimization scheme that can leverage fast construction of a wavefunction to find expectation values of operators.
- the energy E of the system can be minimized by varying over parameters for the wavefunction ansatz:
- ⁇ ( ⁇ ) can be prepared many times with a subsequent measurement of the ⁇ k operator.
- the unitary coupled cluster (UCC) state is used as the function for the energy functional, though others could be considered, such as, for example, the variational adiabatic ansatz.
- UCC is a many-body expansion wavefunction ansatz parameterized by the cluster coefficients associated with each generator.
- the antisymmetric fermionic creation/annihilation operators can be represented by distinguishable qubits.
- JW Jordan-Wigner transformation
- the representation of second quantized operators in Pauli matrices by the JW transform scales linearly in the number of Pauli terms as the basis index is increased.
- the wavefunction of the system can be constructed by first preparing the Hartree-Fock reference, O(n) in the number of gates to prepare the state where n is the number of orbitals, then evolving the initial wavefunction according to Equation (22), using O(n 4 ) in the number of gates for the exponentiation of the unitary generators.
- the 1-RDM can be obtained by contraction from the 2-RDM:
- the fragment 1-RDM of the total system can be matched to the fragment piece of the 1-RDM obtained from the VQE algorithm, for example, by varying the embedding potential in Equation (3).
- Equation (23) and Equation (24), henceforth denoted as ⁇ do not commute with each other at all orders. Therefore, approximating the exponential by a particular order of the Suzuki-Trotter decomposition may be important for constructing accurate distributions.
- the anti-Hermitian generators do not commute because the de-excitation operators —a a 554 a i do not commute with the excitation operators. This can be seen for the first order ⁇ operators.
- a, b to denote the particle space
- i, j to denote the hole space.
- Trotter error is considered when generating circuits for UCC state preparation.
- Trotter order refers to the order of the series approximation to the exponential of two non-commuting operators; and the term “Trotter steps” refers to the number of slices that each order is broken into in order to minimize the correction term.
- H ⁇ - t ⁇ ⁇ ⁇ i , j ⁇ ⁇ ⁇ ( a ⁇ i , ⁇ ⁇ ⁇ a ⁇ j , ⁇ + h . c . ) + U ⁇ ⁇ i ⁇ ⁇ a ⁇ i , ⁇ ⁇ ⁇ a ⁇ i , ⁇ ⁇ ⁇ a ⁇ i , ⁇ ⁇ a ⁇ i , ⁇ ( 33 )
- the DMET self-consistency loops were run using the QC-DMET code with an interface to PySCF for exact diagonalization of the embedded Hamiltonian.
- the VQE algorithm for solving the embedded Hamiltonian used Quil and Rigetti Computing's pyQuil package to construct the UCCSD ansatz and evolved the wavefunction on a noiseless quantum virtual machine. All UCCSD-VQE runs started with a second-order M ⁇ ller-Plesset perturbation theory guess for the cluster amplitudes and utilized about 20 iterations of BFGS with the gradient numerically approximated.
- the low-level and high-level fragment density matrices were equivalent and thus the DMET loop only involved setting the chemical potential such that the number of electrons in each fragment summed to the total system's electron count.
- the fragment 1-RDM was generally not equal to the fragment Slater determinant 1-RDM and thus utilized a numerical search for the optimal embedding potential.
- FIG. 5 is a plot 500 showing energy-per-site from the example calculations for Trotter steps 1, 2, 3, and 4.
- the plot 500 shows energy-per-site of the four-site Hubbard model with U/
- 2 with anti-periodic boundary conditions calculated with Trotter orders 1 and 2 with Trotter steps 1, 2, 3, and 4.
- the error between Trotter steps of Suzuki-Trotter orders is generally hundredths of a milli-Hartree indicating that the significant gap between FCI and UCCSD is based on the wavefunction ansatz.
- FIG. 5 shows the convergence of the energy-per-site as the Trotter order and Trotter steps are increased for U/
- 2.
- Trotter order and Trotter steps indicate the structure of the wavefunction ansatz for UCCSD.
- the first order Trotter with N -Trotter steps produces an ansatz of form:
- ⁇ ( e ⁇ circumflex over ( ⁇ ) ⁇ s /N e ⁇ circumflex over ( ⁇ ) ⁇ d /N ) N (34)
- ⁇ s and ⁇ d correspond to the single and double anti-Hermitian generators with their coefficients which are described in Equation (23) and Equation (24).
- the persistence of the energy gap as Trotter order and Trotter steps are increased demonstrates that the single reference nature and the truncated set of generators are the main sources of error.
- the DMET technique can introduce three sources of error: (i) the fragment size and thus the number of non-interacting bath states that can entangle with the fragment, (ii) the embedded Hamiltonian solver, and (iii) the pieces of the embedded Hamiltonian 1-RDM that are chosen to match for updating the embedding potential.
- the effects of (i) and (ii) can be determined by studying small lattices and comparing the ground state energy against the FCI solution and the full UCCSD solution.
- FIG. 6 is a table 600 showing data from example calculations.
- the table 600 in FIG. shows energy-per-site of the half-filled Hubbard model for a four-site ring with anti-periodic boundary conditions evaluated with DMET using one- and two-site fragments. The exact solution is computed with an exact diagonalization of the Hamiltonian. Both Trotter order and Trotter steps were equal to one for all calculations shown.
- the table 600 shown in FIG. 6 compares the ground state energy-per-site of a four-site ring at various interaction strengths between the FCI solution, the UCCSD solution, and various fragment sizes for DMET.
- the DMET solutions are labeled by DMET(n), where n is the number of sites considered in the fragment, followed by an acronym for the type of embedded solver—for example, ED corresponds to FCI.
- the accuracy of the UCCSD solution to the four-site-ring lattice generally decreases as U is increased demonstrating the expected result that singles and doubles generators cannot parametrize the full unitary group. In this example, a four-site lattice requires eight-spin-orbitals and thus eight qubits.
- the UCCSD ansatz contains 14 cluster amplitudes when restricting the wavefunction to the singlet subspace.
- a single state evolution at first order Trotter involves 1422 time steps where multiple qubit operations are performed at each step.
- Each time step has an average of 0.8692 one-qubit gates and 0.8101 two-qubit gates.
- the coupled-cluster reference is usually chosen in a basis where the one-particle piece of the Hamiltonian is diagonal.
- this involves a Fourier transform on the one-particle and two-particle integral tensors resulting in m one-body terms and m 3 two-body terms where m is the number of lattice sites.
- the two-body terms are proportional to U/N.
- UCCSD+VQE is equivalent to FCI, CISD, and CCSD solvers.
- 2 and U/
- 8 produced energies-per-site of ⁇ 0.9809165 and ⁇ 0.35446392, respectively.
- the error is on the order of the difference between the UCCSD solution for the full lattice and the FCI solution for the full lattice.
- FIG. 7 is a pair of plots 700 A, 700 B showing the energy-per-site and error from example calculations.
- FCI represents the exact diagonalization solution to the single impurity site problem.
- Plot 700 A in FIG. 7 demonstrates that DMET(1)-UCCSD method converges to the correct solution at high-U.
- hybrid classical/quantum computation models fit well with certain techniques for studying the electronic structure of molecules and materials. Some techniques involve selecting an active space or embedded piece of the Hamiltonian to treat at higher fidelity. These techniques can be especially important when describing the electronic structure of correlated materials and molecules such as metal-oxides, heterogeneous catalysis, multi-electron redox reactions, and catalysts. In contrast to exact diagonalization solvers commonly used in impurity or active space problems, quantum computation offers a technique to treat these Hamiltonians with high accuracy in polynomial time.
- a DMET algorithm operates by mapping the problem of finding the N-particle ground state of a large system to many smaller interacting impurity problems. Therefore, DMET is applicable to very large scale problems be it either molecules or materials. Unlike DMFT that requires the frequency dependent two-particle Green's function, DMET utilizes the 1-RDM of the embedded problem with high accuracy. This makes DMET and the VQE an advantageous combination in many instances.
- the 1-RDM and 2-RDM may be computed at each iteration of the VQE optimization.
- the VQE algorithm can be implemented as a general functional minimization routine that allows for the use of any quantum state preparation method.
- classical techniques for describing quantum chemistry or correlated materials can be accelerated with a hardware quantum processing unit (QPU).
- QPU hardware quantum processing unit
- Many of the classical methods that utilize a 1-RDM or 2-RDM of an active space can be integrated with the VQE algorithm or other hybrid classical/quantum techniques. Further integration can lead to methodologies to study large quantum systems with higher resolution than what is currently possible with state of the art classical methods.
- the VQE can be implemented as a classical optimizer around a quantum execution unit.
- a classical optimization loop may produce the next 0 parameters of Equation (20) for minimization.
- ⁇ parameterizes a wavefunction ansatz, but computationally, they are regarded as parameters to generate a new quantum program.
- G ⁇ ⁇ x , ⁇ y , ⁇ z , H , 1 2 ⁇ ( 1 ⁇ i ⁇ i 1 ) , CNOT ⁇ , ( 35 )
- G ′ ⁇ R z ⁇ .
- the machine (
- the gates are understood to be the collection of operators acting on each qubit combination of the quantum state
- the classical memory C is as large as log 2 dim
- ⁇ the number of qubits—to hold the z-basis measurements for each loop of the VQE, which are collected to approximate ⁇ .
- ⁇ can be observed in the computational basis and ⁇ can be computed directly.
- the object of interest to simulate can be specified in terms of sums of fermionic operations, such as the Hamiltonian in Equation (16). After a fermionic transform such as in Equation (25), said object can be represented as a sum of products of Pauli spin operators.
- a fermionic transform such as in Equation (25)
- said object can be represented as a sum of products of Pauli spin operators.
- ⁇ Exponentiating a Pauli sum includes two steps: factorization via Trotterization, and exponentiation of Pauli terms.
- These are represented as objects in Python using the pyQuil library:
- Exponentiation of a Pauli term has three parts: a change to the
- This Quil program itself is also a first-class object. Indeed, the result of a Suzuki-Trotter approximation of, say, e A+B combines programs which compute e A and e B . We can see this by looking at the Quil program which computes e A+B in a first-order decomposition:
- Time Slice #1 X 2 X 3 RX(1.5707963267948966) 5 RX(1.5707963267948966) 1 Time Slice #2: H 3 CNOT 1 2 Time Slice #3: CNOT 3 4 Time Slice #4: CNOT 4 5 Time Slice #5: RZ(0.00001) 5 Time Slice #6: CNOT 4 5 Time Slice #7: CNOT 3 4 RX( ⁇ 1.5707963267948966) 5 Time Slice #8: H 3 H 5 Time Slice #9: CNOT 2 3 Time Slice #10: CNOT 3 4
- the 16-instruction straight-line program has been reduced to a 10-time-slice program averaging 0.9 one-qubit gates and 0.7 two-qubit gates per time slice. All instructions being equal, this gives a 38% improvement in timing.
- a final Quil program When a final Quil program is prepared through the various means described, it is dispatched to a representation of a QAM: either a hardware QPU or a software quantum virtual machine.
- a remotely deployed quantum virtual machine was used for all Quil execution.
- a computer system simulates a quantum system.
- a set of models representing a quantum system is generated, and the quantum system is simulated by operating the set of models on a computer system.
- the set of models includes subsystem models representing respective fragments of the quantum system.
- the computer system includes a classical processor unit and a plurality of unentangled quantum processor units (QPUs). Operating the set of models includes using the unentangled QPUs to operate the respective subsystem models.
- Implementations of the first aspect may include one or more of the following features.
- Operating the set of models can include using two or more of the unentangled QPUs to operate two or more of the subsystem models in parallel.
- Simulating the quantum system can include using density matrix embedding theory (DMET) to compute an approximate ground state energy for the quantum system.
- DMET density matrix embedding theory
- Implementations of the first aspect may include one or more of the following features.
- Using the unentangled QPUs to operate the respective subsystem models comprises executing a variational quantum eigensolver (VQE) algorithm on each QPU to compute reduced density matrices (RDMs) for the respective fragments; for example, one-particle reduced density matrices (1-RDMs), two-particle reduced density matrices (2-RDMs), or both may be computed by the VQE algorithm.
- An approximate ground state energy of the quantum system can be computed from the RDMs.
- the set of models includes an approximate Hamiltonian (e.g., ⁇ chem ) for the quantum system; the approximate Hamiltonian includes embedding potentials (e.g., v r,s ) associated with the respective fragments; the subsystem models are embedded Hamiltonians (e.g., ⁇ emb ) for the respective fragments, and the QPUs compute the RDMs based on the embedded Hamiltonians.
- Simulating the quantum system can include, by operation of the classical processor unit: computing an approximate ground state of the quantum system based on the approximate Hamiltonian having an initial set of values assigned to the embedding potentials; and computing an updated set of values for the embedding potentials based on the RDMs computed by the QPUs.
- Simulating the quantum system can include an iterative process, and each iteration of the iterative process can include computing an approximate ground state of the quantum system for the iteration based on the approximate Hamiltonian; generating subsystem models for the iteration based on the approximate ground state for the iteration; by operation of the unentangled QPUs, computing updated RDMs for the respective fragments based on the updated subsystem models; and computing an updated set of values for the embedding potentials based on the updated RDMs.
- the approximate Hamiltonian may then be updated, for example, by assigning the updated set of values to the embedding potentials in the approximate Hamiltonian.
- the simulation may include calculating an approximate ground state energy of the quantum system, for example, from the updated RDMs.
- fragments of a quantum system to be simulated are identified.
- One or more quantum processor units QPUs
- QPUs are used to generate reduced density matrices (RDMs) for the respective fragments.
- RDMs reduced density matrices
- An approximate ground state energy of the quantum system is computed based on the RDMs.
- Implementations of the second aspect may include one or more of the following features.
- Multiple RDMs may be generated in parallel by multiple unentangled QPUs, with each of the RDMs being generated by a respective one of the unentangled QPUs.
- Each of the RDMs may be generated by a variational quantum eigensolver (VQE) algorithm executed by the one or more QPUs.
- VQE variational quantum eigensolver
- Implementations of the second aspect may include one or more of the following features.
- An approximate Hamiltonian (e.g., ⁇ chem ) representing the quantum system can be defined.
- the approximate Hamiltonian can include embedding potentials (e.g., v r,s ) associated with the respective fragments.
- An approximate ground state of the quantum system can be computed based on the approximate Hamiltonian having an initial set of values assigned to the embedding potentials.
- Embedded Hamiltonians e.g., ⁇ emb
- the one or more QPUs can be used to generating the RDMs based on the embedded Hamiltonians.
- An updated set of values for the embedding potentials can be computed based on the RDMs.
- a quantum simulation method includes: identifying fragments (F) of a quantum system (Q) to be simulated, each fragment representing a quantum subsystem of the quantum system to be simulated; defining an approximate Hamiltonian ( ⁇ chem ) for the quantum system, the approximate Hamiltonian comprising embedding potentials (v r,s ) for the respective fragments; by operation of a classical processor unit, solving for a first approximate ground state
Abstract
Description
This Schmidt basis is constructed by the singular value decomposition of the coefficient tensor. This reformulation demonstrates that there is a local fragment basis and environment basis of the same size that produces an equivalent representation of |ψ. Without loss of generality, we can assume the Hilbert space of the fragment is smaller than the environment. In the Schmidt basis, no matter how large the bath, a fragment A can entangle with dA bath states. The Schmidt states can be used to project the Hamiltonian into a combined impurity/bath basis that has the same ground state as the original Hamiltonian but is significantly smaller in size
To vary the form of the bath states used when constructing the embedded Hamiltonian, a potential may be added to the full chemical Hamiltonian. In some cases, the augmented total system Hamiltonian is then approximated using the Hartree-Fock method to find an optimal single-particle basis, for example:
Note that while each |a′∈B, there are no more than dim A of them. With this form for the embedding basis, the form of the bath states constructed from the mean-field wavefunction can be found. This may be achieved, for example, by projecting the occupied states with overlap on the fragment onto the environment orbitals and normalizing.
The eigenvectors of this overlap matrix correspond to an orbital rotation that forms the fragment and bath basis. Diagonalizing S with a unitary V gives
Δ:=V † SV=diag(Δ1 . . . ,Δd
Naturally, the eigenvalues of the overlap matrix are between 0 and 1. Zero eigenvalues correspond to occupied states that have zero overlap on the fragment. The bath states can be constructed by projecting the occupied orbitals with overlap on the fragment into the bath:
C:=I n
The core states with zero overlap on the fragment can be eliminated from the embedded Hamiltonian by including their interaction at the mean-field level similar to generating an active space interacting with a frozen set of core states.
Ĥ emb:=PĤP (15)
which, for a Slater determinant wavefunction, corresponds to a single- and double-particle integral transform:
Here, the variable u may represent the embedding potentials vr,s in Equation (4), and least squares minimization or another minimization technique can be used to minimize CFfrag with respect to vr,s. This cost function is known as the fragment-only density matrix fitting. Alternatives such as full matching of the 1-RDMs in the embedding basis or matching the electron densities on the fragment have also been studied.
The expectation value can be determined by summing the expectation of each term in the Hamiltonian:
âq † (i<pσi z)σp +
âq (i<pσi z)σp −, (25)
where:
σ±:=½(σx∓iσy). (26)
2 D kl ij=ψ|âi †âj †âlâk|ψ. (27)
The 1-RDM can be obtained by contraction from the 2-RDM:
The fragment 1-RDM of the total system can be matched to the fragment piece of the 1-RDM obtained from the VQE algorithm, for example, by varying the embedding potential in Equation (3).
[â j † â b ,â a † â i]=δb,a â j † â i−δj,i â a † â b (31)
[â b † â j ,â i † â a]=δi,j â b † â a−δb,a â j † â j. (32)
|ψ=(e {circumflex over (τ)}
where τs and τd correspond to the single and double anti-Hermitian generators with their coefficients which are described in Equation (23) and Equation (24). The persistence of the energy gap as Trotter order and Trotter steps are increased demonstrates that the single reference nature and the truncated set of generators are the main sources of error.
Here, the machine =(|ΨΔ, C, G, G′, P, κ) represents a machine with quantum state |Ψ, classical state C, static gates G, parametric gates G′, program P, and program counter κ. In Equations (35) and (36), the gates are understood to be the collection of operators acting on each qubit combination of the quantum state |Ψ. The classical memory C is as large as log2 dim |Ψ—the number of qubits—to hold the z-basis measurements for each loop of the VQE, which are collected to approximate Ĥ. Alternatively, by using a quantum virtual machine, the amplitudes of |Ψ can be observed in the computational basis and Ĥ can be computed directly.
A=2 σ0 xσ1 x,
B=−½σ0 xσ2 z. (37)
These are represented as objects in Python using the pyQuil library:
> A = 2.0*PauliTerm(‘X’,0)*PauliTerm(‘X’,1) | ||
> B = −0.5*PauliTerm(‘X’,0)*PauliTerm(‘Z’,2) | ||
> print “A =”, A, “\nB =”, B | ||
A = 2.0*X0*X1 | ||
B = −0.5*X0*Z2 | ||
> print exponentiate(A) | ||
H 0 | ||
|
||
|
||
RZ(4.0) 1 | ||
|
||
H 0 | ||
|
||
> print trotterize(A, B) | ||
H 0 | ||
|
||
|
||
RZ(4.0) 1 | ||
|
||
H 0 | ||
H 1 | ||
|
||
|
||
RZ(−1.0) 2 | ||
|
||
|
||
X 2 | ||
X 3 | ||
|
||
RX(1.5707963267948966) 5 | ||
|
||
|
||
RZ(0.00001) 5 | ||
|
||
|
||
|
||
RX(−1.5707963267948966) 5 | ||
RX(1.5707963267948966) 1 | ||
|
||
|
||
|
||
|
||
Time Slice #1: | X 2 | ||
|
|||
RX(1.5707963267948966) 5 | |||
RX(1.5707963267948966) 1 | |||
Time Slice #2: | |
||
|
|||
Time Slice #3: | |
||
Time Slice #4: | |
||
Time Slice #5: | RZ(0.00001) 5 | ||
Time Slice #6: | |
||
Time Slice #7: | |
||
RX(−1.5707963267948966) 5 | |||
Time Slice #8: | H 3 | ||
|
|||
Time Slice #9: | |
||
Time Slice #10: | |
||
Claims (34)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/720,088 US10984152B2 (en) | 2016-09-30 | 2017-09-29 | Simulating quantum systems with quantum computation |
US17/192,604 US20210406421A1 (en) | 2016-09-30 | 2021-03-04 | Simulating Quantum Systems with Quantum Computation |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201662402278P | 2016-09-30 | 2016-09-30 | |
US15/720,088 US10984152B2 (en) | 2016-09-30 | 2017-09-29 | Simulating quantum systems with quantum computation |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/192,604 Continuation US20210406421A1 (en) | 2016-09-30 | 2021-03-04 | Simulating Quantum Systems with Quantum Computation |
Publications (2)
Publication Number | Publication Date |
---|---|
US20180096085A1 US20180096085A1 (en) | 2018-04-05 |
US10984152B2 true US10984152B2 (en) | 2021-04-20 |
Family
ID=61758288
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/720,088 Active 2038-12-01 US10984152B2 (en) | 2016-09-30 | 2017-09-29 | Simulating quantum systems with quantum computation |
US17/192,604 Pending US20210406421A1 (en) | 2016-09-30 | 2021-03-04 | Simulating Quantum Systems with Quantum Computation |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/192,604 Pending US20210406421A1 (en) | 2016-09-30 | 2021-03-04 | Simulating Quantum Systems with Quantum Computation |
Country Status (3)
Country | Link |
---|---|
US (2) | US10984152B2 (en) |
EP (1) | EP3520041A4 (en) |
WO (1) | WO2018064535A1 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20210174236A1 (en) * | 2018-08-07 | 2021-06-10 | Google Llc | Variational quantum state preparation |
US11442891B2 (en) * | 2019-12-06 | 2022-09-13 | Quantinuum Llc | Holographic quantum dynamics simulation |
US11868846B1 (en) * | 2020-06-23 | 2024-01-09 | Amazon Technologies, Inc. | Quantum computing simulation using comparative rejection sampling |
Families Citing this family (67)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10127499B1 (en) | 2014-08-11 | 2018-11-13 | Rigetti & Co, Inc. | Operating a quantum processor in a heterogeneous computing architecture |
US11797641B2 (en) | 2015-02-03 | 2023-10-24 | 1Qb Information Technologies Inc. | Method and system for solving the lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer |
CA2881033C (en) | 2015-02-03 | 2016-03-15 | 1Qb Information Technologies Inc. | Method and system for solving lagrangian dual of a constrained binary quadratic programming problem |
US10599988B2 (en) | 2016-03-02 | 2020-03-24 | D-Wave Systems Inc. | Systems and methods for analog processing of problem graphs having arbitrary size and/or connectivity |
US10044638B2 (en) | 2016-05-26 | 2018-08-07 | 1Qb Information Technologies Inc. | Methods and systems for quantum computing |
US9870273B2 (en) | 2016-06-13 | 2018-01-16 | 1Qb Information Technologies Inc. | Methods and systems for quantum ready and quantum enabled computations |
US10311370B2 (en) * | 2016-08-17 | 2019-06-04 | International Business Machines Corporation | Efficient reduction of resources for the simulation of Fermionic Hamiltonians on quantum hardware |
JP6918980B2 (en) * | 2017-05-15 | 2021-08-11 | グーグル エルエルシーGoogle LLC | Operator averaging in quantum computing systems |
US11250190B2 (en) * | 2017-09-22 | 2022-02-15 | International Business Machines Corporation | Simulating quantum circuits |
US10452990B2 (en) | 2017-11-28 | 2019-10-22 | International Business Machines Corporation | Cost function deformation in quantum approximate optimization |
US11521103B1 (en) | 2017-12-12 | 2022-12-06 | Rigetti & Co, Llc | Utilizing multiple quantum processor unit (QPU) instances |
WO2019144118A1 (en) | 2018-01-22 | 2019-07-25 | D-Wave Systems Inc. | Systems and methods for improving performance of an analog processor |
US10838792B1 (en) * | 2018-03-07 | 2020-11-17 | Quantum Benchmark, Inc. | Systems and methods for reconstructing noise from pauli fidelities |
CA3093230A1 (en) * | 2018-04-20 | 2019-10-24 | Google Llc | Techniques for obtaining accurate diagonal electronic structure hamiltonians |
US11308248B2 (en) | 2018-05-05 | 2022-04-19 | Intel Corporation | Apparatus and method for quantum computing performance simulation |
US11551127B1 (en) * | 2018-05-09 | 2023-01-10 | Rigetti & Co, Llc | Using a quantum processor unit to preprocess data |
GB201807973D0 (en) * | 2018-05-16 | 2018-07-04 | River Lane Res Ltd | Estimating an energy level of a physical system |
EP3794520A4 (en) * | 2018-05-18 | 2022-03-23 | Rigetti & Co. LLC | Computing platform with heterogenous quantum processors |
WO2019229527A2 (en) * | 2018-05-31 | 2019-12-05 | Oti Lumionics Inc. | Methods and systems for solving a problem on a quantum computer |
US20210132969A1 (en) * | 2018-06-13 | 2021-05-06 | Rigetti & Co, Inc. | Quantum Virtual Machine for Simulation of a Quantum Processing System |
WO2020033807A1 (en) * | 2018-08-09 | 2020-02-13 | Rigetti & Co, Inc. | Quantum streaming kernel |
US20200057957A1 (en) * | 2018-08-17 | 2020-02-20 | Zapata Computing, Inc. | Quantum Computer with Improved Quantum Optimization by Exploiting Marginal Data |
US11507872B2 (en) | 2018-08-17 | 2022-11-22 | Zapata Computing, Inc. | Hybrid quantum-classical computer system and method for performing function inversion |
US11847534B2 (en) | 2018-08-31 | 2023-12-19 | D-Wave Systems Inc. | Systems and methods for operation of a frequency multiplexed resonator input and/or output for a superconducting device |
US11372651B2 (en) * | 2018-09-10 | 2022-06-28 | International Business Machines Corporation | Bootstrapping a variational algorithm for quantum computing |
US11074519B2 (en) * | 2018-09-20 | 2021-07-27 | International Business Machines Corporation | Quantum algorithm concatenation |
CN112771552A (en) * | 2018-09-25 | 2021-05-07 | 谷歌有限责任公司 | Error correction variational algorithm |
US11169801B2 (en) | 2018-10-05 | 2021-11-09 | Zapata Computing, Inc. | Hybrid quantum-classical computer for variational coupled cluster method |
CA3112594A1 (en) | 2018-10-12 | 2020-04-16 | Zapata Computing, Inc. | Quantum computer with improved continuous quantum generator |
US11593174B2 (en) | 2018-10-16 | 2023-02-28 | D-Wave Systems Inc. | Systems and methods for scheduling programs for dedicated execution on a quantum processor |
AU2019365240A1 (en) | 2018-10-24 | 2021-04-15 | Zapata Computing, Inc. | Hybrid quantum-classical computer system for implementing and optimizing quantum Boltzmann machines |
US10504033B1 (en) | 2018-11-13 | 2019-12-10 | Atom Computing Inc. | Scalable neutral atom based quantum computing |
US11580435B2 (en) | 2018-11-13 | 2023-02-14 | Atom Computing Inc. | Scalable neutral atom based quantum computing |
US10776544B2 (en) * | 2018-12-07 | 2020-09-15 | IonQ, Inc. | Classical optimizer for quantum chemistry circuit synthesis |
WO2020150156A1 (en) | 2019-01-17 | 2020-07-23 | D-Wave Systems, Inc. | Systems and methods for hybrid algorithms using cluster contraction |
US11593695B2 (en) * | 2019-03-26 | 2023-02-28 | D-Wave Systems Inc. | Systems and methods for hybrid analog and digital processing of a computational problem using mean fields |
US11341427B2 (en) | 2019-04-09 | 2022-05-24 | International Business Machines Corporation | Adiabatic progression with intermediate re-optimization to solve hard variational quantum problems in quantum computing |
US11488049B2 (en) | 2019-04-09 | 2022-11-01 | Zapata Computing, Inc. | Hybrid quantum-classical computer system and method for optimization |
DE102019109816A1 (en) | 2019-04-12 | 2020-10-15 | HQS Quantum Simulations GmbH | METHOD OF MODELING A SYSTEM BY USING A QUANTUM COMPUTER |
US11620569B2 (en) * | 2019-04-26 | 2023-04-04 | International Business Machines Corporation | Machine learning quantum algorithm validator |
US11288073B2 (en) | 2019-05-03 | 2022-03-29 | D-Wave Systems Inc. | Systems and methods for calibrating devices using directed acyclic graphs |
US11537928B2 (en) | 2019-05-03 | 2022-12-27 | Zapata Computing, Inc. | Quantum-classical system and method for matrix computations |
WO2020227825A1 (en) * | 2019-05-13 | 2020-11-19 | 1Qb Information Technologies Inc. | Methods and systems for quantum computing enabled molecular ab initio simulations |
EP3983961A4 (en) | 2019-06-14 | 2023-06-21 | Zapata Computing, Inc. | Hybrid quantum-classical computer for bayesian inference with engineered likelihood functions for robust amplitude estimation |
US11494532B2 (en) | 2019-06-17 | 2022-11-08 | International Business Machines Corporation | Simulation-based optimization on a quantum computer |
WO2020255076A1 (en) | 2019-06-19 | 2020-12-24 | 1Qb Information Technologies Inc. | Method and system for mapping a dataset from a hilbert space of a given dimension to a hilbert space of a different dimension |
US11879789B2 (en) | 2019-07-02 | 2024-01-23 | International Business Machines Corporation | On-chip thermometer for superconducting quantum computing devices |
US11674854B2 (en) | 2019-07-02 | 2023-06-13 | International Business Machines Corporation | Mapping temperature distribution in superconducting devices |
US20210012233A1 (en) * | 2019-07-11 | 2021-01-14 | International Business Machines Corporation | Adaptive compilation of quantum computing jobs |
US20220253740A1 (en) * | 2019-07-12 | 2022-08-11 | D-Wave Systems Inc. | Systems and methods for simulating a quantum processor |
US11714730B2 (en) | 2019-08-20 | 2023-08-01 | D-Wave Systems Inc. | Systems and methods for high availability, failover and load balancing of heterogeneous resources |
US11294986B2 (en) | 2019-11-22 | 2022-04-05 | International Business Machines Corporation | Iterative energy-scaled variational quantum eigensolver |
US11735291B2 (en) | 2019-12-20 | 2023-08-22 | International Business Machines Corporation | Quantum computing thermodynamic observables of a chemical system |
EP4115352A1 (en) | 2020-03-02 | 2023-01-11 | Atom Computing Inc. | Scalable neutral atom based quantum computing |
CA3175359A1 (en) * | 2020-04-13 | 2021-10-21 | Lionel W. Poirier | Methods and systems for quantum computational chemistry modeling |
US11550696B2 (en) * | 2020-06-30 | 2023-01-10 | EMC IP Holding Company LLC | Quantum compute estimator and intelligent infrastructure |
US11942192B2 (en) | 2020-07-13 | 2024-03-26 | International Business Machines Corporation | Density-functional theory determinations using a quantum computing system |
JP2023546590A (en) * | 2020-10-19 | 2023-11-06 | グーグル エルエルシー | Quantum computing using kernel methods for machine learning |
KR102628180B1 (en) * | 2020-11-10 | 2024-01-24 | 한국과학기술원 | First-principles-derived effective mass approximation simulation method for the accurate description of optical properties of 1d and 2d quantum nanostructures and the system thereof |
WO2022107298A1 (en) * | 2020-11-20 | 2022-05-27 | 富士通株式会社 | Quantum calculation control program, quantum calculation control method, and information processing device |
US11803611B2 (en) | 2020-12-04 | 2023-10-31 | International Business Machines Corporation | Procedure to speed-up Variational Quantum Eigensolver calculations in quantum computers |
US20220237489A1 (en) * | 2021-01-27 | 2022-07-28 | International Business Machines Corporation | Quantum processor architecture with compiler support |
CA3212467A1 (en) | 2021-03-23 | 2022-09-29 | Guoming WANG | Classically-boosted quantum optimization |
CN117651955A (en) * | 2021-06-03 | 2024-03-05 | Qc韦尔公司 | Exponential spin embedding for quantum computers |
CN113506591B (en) * | 2021-08-09 | 2024-03-08 | 上海思朗科技有限公司 | Covalent bond potential distribution method and system |
US11875227B2 (en) | 2022-05-19 | 2024-01-16 | Atom Computing Inc. | Devices and methods for forming optical traps for scalable trapped atom computing |
CN117079738A (en) * | 2022-10-24 | 2023-11-17 | 上海微观纪元数字科技有限公司 | Quantum calculation-based comprehensive calculation method for molecular binding energy |
Citations (33)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050005266A1 (en) | 1997-05-01 | 2005-01-06 | Datig William E. | Method of and apparatus for realizing synthetic knowledge processes in devices for useful applications |
US20050182614A1 (en) | 2004-02-12 | 2005-08-18 | Microsoft Corporation | Systems and methods that facilitate quantum computer simulation |
US20050273306A1 (en) | 2001-12-22 | 2005-12-08 | Hilton Jeremy P | Hybrid classical-quantum computer architecture for molecular modeling |
WO2005122052A1 (en) | 2004-06-05 | 2005-12-22 | D-Wave Systems, Inc. | Hybrid classical-quantum computer architecture for molecular modeling |
US20060101236A1 (en) | 2004-10-13 | 2006-05-11 | Samsung Electronics Co., Ltd. | Method and apparatus for increasing processing speed using quantum coprocessor |
US20060224547A1 (en) * | 2005-03-24 | 2006-10-05 | Ulyanov Sergey V | Efficient simulation system of quantum algorithm gates on classical computer based on fast algorithm |
US20090070402A1 (en) | 2007-09-11 | 2009-03-12 | Geordie Rose | Systems, methods, and apparatus for a distributed network of quantum computers |
US20090075825A1 (en) | 2007-08-21 | 2009-03-19 | Geordie Rose | Systems, methods, and apparatus for controlling the elements of superconducting processors |
US20090157778A1 (en) * | 2007-12-12 | 2009-06-18 | Allen Edward H | Computer systems using quantum allegories as oracles |
US20090164435A1 (en) * | 2007-12-20 | 2009-06-25 | Routt Thomas J | Methods and systems for quantum search, computation and memory |
US7875876B1 (en) | 2006-06-15 | 2011-01-25 | Hrl Laboratories, Llc | Scalable quantum computer |
US20110137632A1 (en) | 2004-02-20 | 2011-06-09 | The Mathworks, Inc. | Method and apparatus for integrated modeling, simulation and analysis of chemical and biochemical reactions |
US20110238378A1 (en) * | 2007-12-12 | 2011-09-29 | Allen Edward H | Computer systems and methods for quantum verification and validation |
US20110313741A1 (en) * | 2010-06-21 | 2011-12-22 | Spectral Associates, Llc | Methodology and its computational implementation for quantitative first-principles quantum-mechanical predictions of the structures and properties of matter |
US20120079177A1 (en) | 2008-08-05 | 2012-03-29 | Convey Computer | Memory interleave for heterogeneous computing |
US8175995B2 (en) | 2008-06-10 | 2012-05-08 | D-Wave Systems Inc. | Quantum and digital processor hybrid systems and methods to solve problems |
US20120192200A1 (en) | 2011-01-21 | 2012-07-26 | Rao Jayanth N | Load Balancing in Heterogeneous Computing Environments |
WO2013006836A1 (en) | 2011-07-06 | 2013-01-10 | D-Wave Systems Inc. | Quantum processor based systems and methods that minimize an objective function |
US20130160016A1 (en) | 2011-12-16 | 2013-06-20 | Advanced Micro Devices, Inc. | Allocating Compute Kernels to Processors in a Heterogeneous System |
US20130222399A1 (en) | 2012-02-27 | 2013-08-29 | Qualcomm Incorporated | Execution model for heterogeneous computing |
US20130332702A1 (en) | 2012-06-08 | 2013-12-12 | Advanced Micro Devices, Inc. | Control flow in a heterogeneous computer system |
US20140164313A1 (en) * | 2014-02-17 | 2014-06-12 | Invent.ly LLC | Method and Apparatus for Predicting Subject Responses to a Proposition based on Quantum Representation of the Subject's Internal State and of the Proposition |
US20140297247A1 (en) | 2013-03-26 | 2014-10-02 | Microsoft Corporation | Quantum Annealing Simulator |
US20140354326A1 (en) * | 2013-05-29 | 2014-12-04 | Microsoft Corporation | Quantum Computers Having Partial Interferometric Quantum Gates |
US20150142398A1 (en) | 2013-11-20 | 2015-05-21 | California Institute Of Technology | Methods for a multi-scale description of the electronic structure of molecular systems and materials and related applications |
US9286154B2 (en) * | 2013-06-07 | 2016-03-15 | Alcatel Lucent | Error correction for entangled quantum states |
CN105787292A (en) | 2014-12-18 | 2016-07-20 | 中国科学院大连化学物理研究所 | Protein folding parallel predicting method |
US20170161632A1 (en) * | 2007-09-07 | 2017-06-08 | Microsoft Technology Licensing, Llc | Measurement-only topological quantum computation |
US20170179960A1 (en) * | 2014-02-12 | 2017-06-22 | Microsoft Technology Licensing, Llc | Improved quantum circuit for chemistry simulation |
US10127499B1 (en) | 2014-08-11 | 2018-11-13 | Rigetti & Co, Inc. | Operating a quantum processor in a heterogeneous computing architecture |
US10633248B2 (en) * | 2013-01-15 | 2020-04-28 | Alcatel Lucent | Syndrome of degraded quantum redundancy coded states |
US10671559B2 (en) * | 2014-03-21 | 2020-06-02 | Google Llc | Chips including classical and quantum computing processors |
US10698789B1 (en) * | 2018-12-05 | 2020-06-30 | International Business Machines Corporation | Fuzz testing for quantum SDK |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070239366A1 (en) * | 2004-06-05 | 2007-10-11 | Hilton Jeremy P | Hybrid classical-quantum computer architecture for molecular modeling |
-
2017
- 2017-09-29 US US15/720,088 patent/US10984152B2/en active Active
- 2017-09-29 WO PCT/US2017/054421 patent/WO2018064535A1/en unknown
- 2017-09-29 EP EP17857532.0A patent/EP3520041A4/en active Pending
-
2021
- 2021-03-04 US US17/192,604 patent/US20210406421A1/en active Pending
Patent Citations (39)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050005266A1 (en) | 1997-05-01 | 2005-01-06 | Datig William E. | Method of and apparatus for realizing synthetic knowledge processes in devices for useful applications |
US20050273306A1 (en) | 2001-12-22 | 2005-12-08 | Hilton Jeremy P | Hybrid classical-quantum computer architecture for molecular modeling |
US20050182614A1 (en) | 2004-02-12 | 2005-08-18 | Microsoft Corporation | Systems and methods that facilitate quantum computer simulation |
US20110137632A1 (en) | 2004-02-20 | 2011-06-09 | The Mathworks, Inc. | Method and apparatus for integrated modeling, simulation and analysis of chemical and biochemical reactions |
WO2005122052A1 (en) | 2004-06-05 | 2005-12-22 | D-Wave Systems, Inc. | Hybrid classical-quantum computer architecture for molecular modeling |
US20060101236A1 (en) | 2004-10-13 | 2006-05-11 | Samsung Electronics Co., Ltd. | Method and apparatus for increasing processing speed using quantum coprocessor |
US20060224547A1 (en) * | 2005-03-24 | 2006-10-05 | Ulyanov Sergey V | Efficient simulation system of quantum algorithm gates on classical computer based on fast algorithm |
US7875876B1 (en) | 2006-06-15 | 2011-01-25 | Hrl Laboratories, Llc | Scalable quantum computer |
US20090075825A1 (en) | 2007-08-21 | 2009-03-19 | Geordie Rose | Systems, methods, and apparatus for controlling the elements of superconducting processors |
US20170161632A1 (en) * | 2007-09-07 | 2017-06-08 | Microsoft Technology Licensing, Llc | Measurement-only topological quantum computation |
US20090070402A1 (en) | 2007-09-11 | 2009-03-12 | Geordie Rose | Systems, methods, and apparatus for a distributed network of quantum computers |
US20090157778A1 (en) * | 2007-12-12 | 2009-06-18 | Allen Edward H | Computer systems using quantum allegories as oracles |
US8832164B2 (en) * | 2007-12-12 | 2014-09-09 | Lockheed Martin Corporation | Computer systems using quantum allegories as oracles |
US20110238378A1 (en) * | 2007-12-12 | 2011-09-29 | Allen Edward H | Computer systems and methods for quantum verification and validation |
US8832165B2 (en) * | 2007-12-12 | 2014-09-09 | Lockheed Martin Corporation | Computer systems and methods for quantum verification and validation |
US20090164435A1 (en) * | 2007-12-20 | 2009-06-25 | Routt Thomas J | Methods and systems for quantum search, computation and memory |
US20120254586A1 (en) | 2008-06-10 | 2012-10-04 | D-Wave Systems Inc. | Quantum and digital processor hybrid systems and methods to solve problems |
US8175995B2 (en) | 2008-06-10 | 2012-05-08 | D-Wave Systems Inc. | Quantum and digital processor hybrid systems and methods to solve problems |
US20120079177A1 (en) | 2008-08-05 | 2012-03-29 | Convey Computer | Memory interleave for heterogeneous computing |
US20110313741A1 (en) * | 2010-06-21 | 2011-12-22 | Spectral Associates, Llc | Methodology and its computational implementation for quantitative first-principles quantum-mechanical predictions of the structures and properties of matter |
US20120192200A1 (en) | 2011-01-21 | 2012-07-26 | Rao Jayanth N | Load Balancing in Heterogeneous Computing Environments |
WO2013006836A1 (en) | 2011-07-06 | 2013-01-10 | D-Wave Systems Inc. | Quantum processor based systems and methods that minimize an objective function |
US20130160016A1 (en) | 2011-12-16 | 2013-06-20 | Advanced Micro Devices, Inc. | Allocating Compute Kernels to Processors in a Heterogeneous System |
US20130222399A1 (en) | 2012-02-27 | 2013-08-29 | Qualcomm Incorporated | Execution model for heterogeneous computing |
US20130332702A1 (en) | 2012-06-08 | 2013-12-12 | Advanced Micro Devices, Inc. | Control flow in a heterogeneous computer system |
US10633248B2 (en) * | 2013-01-15 | 2020-04-28 | Alcatel Lucent | Syndrome of degraded quantum redundancy coded states |
US20140297247A1 (en) | 2013-03-26 | 2014-10-02 | Microsoft Corporation | Quantum Annealing Simulator |
US20140354326A1 (en) * | 2013-05-29 | 2014-12-04 | Microsoft Corporation | Quantum Computers Having Partial Interferometric Quantum Gates |
US9286154B2 (en) * | 2013-06-07 | 2016-03-15 | Alcatel Lucent | Error correction for entangled quantum states |
US20150142398A1 (en) | 2013-11-20 | 2015-05-21 | California Institute Of Technology | Methods for a multi-scale description of the electronic structure of molecular systems and materials and related applications |
US20170179960A1 (en) * | 2014-02-12 | 2017-06-22 | Microsoft Technology Licensing, Llc | Improved quantum circuit for chemistry simulation |
US9819347B2 (en) * | 2014-02-12 | 2017-11-14 | Microsoft Technology Licensing, Llc | Quantum circuit for chemistry simulation |
US20140164313A1 (en) * | 2014-02-17 | 2014-06-12 | Invent.ly LLC | Method and Apparatus for Predicting Subject Responses to a Proposition based on Quantum Representation of the Subject's Internal State and of the Proposition |
US10671559B2 (en) * | 2014-03-21 | 2020-06-02 | Google Llc | Chips including classical and quantum computing processors |
US10127499B1 (en) | 2014-08-11 | 2018-11-13 | Rigetti & Co, Inc. | Operating a quantum processor in a heterogeneous computing architecture |
US10402743B1 (en) | 2014-08-11 | 2019-09-03 | Rigetti & Co, Inc. | Operating a quantum processor in a heterogeneous computing architecture |
US10650324B1 (en) | 2014-08-11 | 2020-05-12 | Rigetti & Co, Inc. | Operating a quantum processor in a heterogeneous computing architecture |
CN105787292A (en) | 2014-12-18 | 2016-07-20 | 中国科学院大连化学物理研究所 | Protein folding parallel predicting method |
US10698789B1 (en) * | 2018-12-05 | 2020-06-30 | International Business Machines Corporation | Fuzz testing for quantum SDK |
Non-Patent Citations (54)
Title |
---|
Advanced Micro Devices, Inc; "What is Heterogeneous Computing", AMD Developer Central; http://developer.amd.com/resources/heterogenous-computing/what-is-heterogeneous-computing/; copyright 2014; accessed Aug. 9, 2015; 7 pgs. |
Bauer, Bela , et al., "Hybrid quantum-classical approach to correlated materials", 1510.03859v2 [quant-ph], Aug. 29, 2016, 11 pgs. |
Booth , et al., "Spectral functions of strongly correlated extended systems via an exact quantum embedding", Physical Review B91, 155107, 2015, 6 pgs. |
Bravyi , et al., "Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates", arXiv:1601.07601v2 [quant-ph], Jan. 27, 2017, 20 pgs. |
Bravyi , et al., "Trading classical and quantum computational resources", arXiv:1506.01396v1 [quant-ph], Jun. 3, 2015; 14 pgs. |
Bulik , "Electron correlation in extended systems via quantum embedding", Doctoral thesis, Rice University, May 2015, 117. |
Bulik , et al., "Can single-reference coupled cluster theory describe static correlation?", arXiv:1505.01894v1 [physics.chem-ph] May 8, 2015, May 11, 2015, 10 pgs. |
Bulik , et al., "Density matrix embedding from broken symmetry lattice mean fields", Physical Review B89, 035140, Jan. 27, 2014, 12 pgs. |
Bulik , et al., "Electron correlation in solids via density embedding theory", The Journal of Chemical Physics 141, 054113, Aug. 7, 2014, 10 pgs. |
Corcoles , et al., "Process verification of two-qubit quantum gates by randomized benchmarking", Physical Review A 87, 030301(R)(2013), Mar. 19, 2013; 4 pgs. |
Crawford , et al., "An Introduction to Coupled Cluster Theory for Computational Chemists", Reviews in Computational Chemistry, vol. 14, 2000, 104 pgs. |
Dallaire-Demers, Pierre-Luc , et al., "Quantum gates and architecture for the quantum simulation of the Fermi-Hubbard model", arXiv:1606.00208v1 [quant-ph], Jun. 2, 2016, 13 pgs. |
EPO, Extended European Search Report dated Jun. 26, 2020, in EP 17857532.0, 9 pgs. |
Gidofalvi , et al., "Multireference self-consistent-field energies without the many-electron wave function through a variational low-rank two-electron reduced-density-matrix method", The Journal of Chemical Physics 127, 244105, Dec. 28, 2007, 6 pgs. |
Helgaker , et al., "Molecular Electronic-Structure Theory", John Wiley & Sons Ltd., West Sussex, England, 2000, 8 pgs. |
Hosteny , et al., "Ab initio study of the pi-electron states of trans-butadiene", The Journal of Chemical Physics, vol. 62, No. 12, Jun. 15, 1975, 16 pgs. |
KIPO, International Search Report and Written Opinion of the ISA dated Jan. 19, 2018, in PCT/US2017/054421, 10 pgs. |
Knizia , et al., "Density Matrix Embedding: A Simple Alternative to Dynamical Mean-Field Theory", Physical Review Letters PRL 109,186404, Nov. 2, 2012, 5 pgs. |
Knizia , et al., "Density Matrix Embedding: A Strong-Coupling Quantum Embedding Theory", Journal of Chemical Theory and Computation, Feb. 21, 2013, 5 pgs. |
Kretchmer , et al., "A real-time extension of density matrix embedding theory for non-equilibrium electron dynamics", arXiv:1609.07678v2, Nov. 1, 2017, 15 pgs. |
Kreula , et al., "Few-qubit quantum-classical simulation of strongly correlated lattice fermions", EPJ Quantum Technology 3:11, 2016, 19 pgs. |
Li , et al., "Hybrid parallel tempering and simulated annealing method", Applied Mathematics and Computation, vol. 212, Issue 1, pp. 216-228, Jun. 1, 2009. |
Lieb , et al. "The one-dimensional Hubbard model: a reminiscence", Physica A 321; www.elsevier.com/locate/physa, 2003, 27 pgs. |
McClean , et al., "The theory of variational hybrid quantum-classical algorithms", New J. Phys. 18 (2016)023023, Feb. 5, 2016, 23 pgs. |
McClean, J. R., et al., "Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States", arXiv:1603.05681v1 [quant-ph], Mar. 17, 2016, 10 pgs. |
McClean, Jarrod Ryan, "Algorithms Bridging Quantum Computation and Chemistry", Doctoral dissertation, Harvard University, Graduate School of Arts & Sciences; http://nrs.harvard.edu/urn-3:HUL.InstRepos:17467376, May 1, 2015, 245 pgs. |
Neilsen , et al., "Quantum Computation and Quantum Information", Cambridge University Press; Cambridge, UK, 2010, 13 pgs. |
O'Malley , et al., "Scalable Quantum Simulation of Molecular Energies", arXiv:1512.06860v2 [quant-ph], Feb. 4, 2017, 13 pgs. |
Peruzzo , et al., "A variational eigenvalue solver on a quantum processor", arXiv:1304.3061v2 [quant-ph]; Apr. 10, 2013; 10 pgs. |
Peruzzo, Alberto , et al., "A variational eigenvalue solver on a photonic quantum processor", Nature Communications, DOI: 10.1038/ncomms5213, Jul. 23, 2014. |
Peschel , et al., "Entanglement in Solvable Many-Particle Models", arXiv:1109.0159v1 [cond-mat.stat-mech], Sep. 1, 2011, 44 pgs. |
Reiner , et al., "Elucidating Reaction Mechanisms on Quantum Computers", arXiv:1605.03590v2 [quant-ph], May 25, 2016, 28 pgs. |
Rubin , "A Hybrid Classical/Quantum Approach for Large-Scale Studies of quantum Systems with Density Matrix Embedding Theory", arXiv:1610.06910v1, Oct. 21, 2016, 12 pgs. |
Rubin , "A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory", arXiv:1610.06910v2, Oct. 24, 2016, 10 pgs. |
Sawaya , et al., "Error Sensitivity to Environmental Noise in Quantum Circuits for Chemical State Preparation", Journal of Chemical Theory and Computation, ACS Publications, Jun. 2, 2016, 12 pgs. |
Scuseria , et al., "An efficient reformulation of the closed-shell coupled cluster single and double excitation (CCSD) equations", J. Chem. Phys. 89(12), Dec. 15, 1988, 6 pgs. |
Seeley , et al., "The Bravyi-Kitaev transformation for quantum computation of electronic structure", The Journal of Chemical Physics 137, 224109, Dec. 12, 2012, 16 pgs. |
Selinger , et al., "A lambda calculus for quantum computation with classical control", arXiv:cs/0404056v2 [cs.LO], Nov. 2004; 15 pgs. |
Shiba , "Magnetic Susceptibility at Zero Temperature for the One-Dimensional Hubbard Model", Physical Review B, vol. 6, No. 3; Aug. 1, 1972, 9 pgs. |
Smith, R. S., et al., "A Practical Quantum Instruction Set Architecture", arXiv:1608.03355v2 [quant-ph], Feb. 17, 2017, 15 pages. |
Suzuki , "Convergence of General Decompositions of Exponential Operators", Commun. Math. Phys. 163, 491-508, 1994, 18 pgs. |
Szabo , et al., "Modern Quantum Chemistry: Introduction to Advanced Electronic Structure Theory", Macmillan Publishing Co., Inc., 1982, 48 pgs. |
Tranter , et al., "The Bravyi-Kitaev Transformation: Properties and Applications", Int'l Journal of Quantum Chemistry 115, 1431-1441, 2015, 11 pgs. |
Trotter , "On the Product of Semi-Groups of Operators", Proceedings of the American Mathematical Society 10, 545; 1959, 7 pgs. |
Tsuchimochi , et al., "Density matrix embedding in an antisymmetrized geminal power bath", The Journal of Chemical Physics 143, 024107, 2015, 11 pgs. |
USPTO, Notice of Allowance dated Sep. 21, 2018, in U.S. Appl. No. 14/822,317, 35 pgs. |
Wang , et al., "Quantum Simulation of Helium Hydride Cation in a Solid-State Spin Register", ACS NANO, vol. 9, No. 8, 7769-7774, www.acsnano.org, Apr. 23, 2015, 13 pgs. |
Wecker, Dave , et al., "Towards Practical Quantum Variational Algorithms", arXiv:1507.08969v2 [quant-ph], Sep. 8, 2015, 11 pages. |
Werner , et al., "A second order multiconfiguration SCF procedure with optimum convergence", J. Chem. Phys. 82(11), Jun. 1, 1985, 11 pgs. |
Whitfield, James D., et al., "Simulation of Electronic Structure Hamiltonians Using Quantum Computers", arXiv:1001.3855v3 [quant-ph], Dec. 19, 2010, 22 pages. |
Wiebe , et al., "Quantum Deep Learning", arXiv:1412.3489v2 [quant-ph]; May 2015; 34 pgs. |
Wouters , et al., "A Practical Guide to Density Matrix Embedding Theory in Quantum Chemistry", J.Chem.Theory Comput., May 9, 2016, 14 pgs. |
Zheng , et al., "Ground-state phase diagram of the square lattice Hubbard model from density matrix embedding theory", arXiv:1504.01784v3 [cond-mat.str-el], May 21, 2015, 17 pgs. |
Zheng, Bo-Xiao , et al., "Cluster size convergence of the density matrix embedding theory and its dynamical cluster formulation: a study with an auxiliary-field quantum Monte Carlo solver", arXiv:1608.03316v1 [cond-mat.str-el], Aug. 11, 2016, 14 pgs. |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20210174236A1 (en) * | 2018-08-07 | 2021-06-10 | Google Llc | Variational quantum state preparation |
US11442891B2 (en) * | 2019-12-06 | 2022-09-13 | Quantinuum Llc | Holographic quantum dynamics simulation |
US11868846B1 (en) * | 2020-06-23 | 2024-01-09 | Amazon Technologies, Inc. | Quantum computing simulation using comparative rejection sampling |
Also Published As
Publication number | Publication date |
---|---|
WO2018064535A1 (en) | 2018-04-05 |
US20210406421A1 (en) | 2021-12-30 |
US20180096085A1 (en) | 2018-04-05 |
EP3520041A4 (en) | 2020-07-29 |
EP3520041A1 (en) | 2019-08-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20210406421A1 (en) | Simulating Quantum Systems with Quantum Computation | |
Margossian | A review of automatic differentiation and its efficient implementation | |
US11900212B1 (en) | Constructing quantum processes for quantum processors | |
Lamm et al. | General methods for digital quantum simulation of gauge theories | |
US11551133B2 (en) | Preparing correlated fermionic states on a quantum computer | |
US10846366B1 (en) | Selecting parameters for a quantum approximate optimization algorithm (QAOA) | |
Rubin | A hybrid classical/quantum approach for large-scale studies of quantum systems with density matrix embedding theory | |
US20230143652A1 (en) | Automated Synthesizing of Quantum Programs | |
US20240054374A1 (en) | Methods and systems for solving a problem on a quantum computer | |
Kökcü et al. | Fixed depth Hamiltonian simulation via Cartan decomposition | |
US20230020166A1 (en) | Efficient quantum chemistry simulation using gate-based qubit quantum devices | |
EP3105719B1 (en) | Classical simulation constants and ordering for quantum chemistry simulation | |
KR20210011409A (en) | Estimation of energy levels in physical systems | |
Doronin et al. | Solving systems of linear algebraic equations via unitary transformations on quantum processor of IBM Quantum Experience | |
Li et al. | Experimental study of Forrelation in nuclear spins | |
Schmitt et al. | jVMC: Versatile and performant variational Monte Carlo leveraging automated differentiation and GPU acceleration | |
Alonso et al. | Entropy and canonical ensemble of hybrid quantum classical systems | |
Li et al. | Succinct description and efficient simulation of non-markovian open quantum systems | |
Armstrong et al. | Inference offers a metric to constrain dynamical models of neutrino flavor transformation | |
US11604644B1 (en) | Accelerating hybrid quantum/classical algorithms | |
Ozhigov | About quantum computer software | |
Novikau et al. | Simulation of linear non-Hermitian boundary-value problems with quantum singular-value transformation | |
Zuo et al. | Fast and practical quantum-inspired classical algorithms for solving linear systems | |
US20230401485A1 (en) | Apparatus And Method For Optimizing, Monitoring And Controlling A Real Physical System | |
US20240037304A1 (en) | Quantum circuit for simulating boundary operator |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: RIGETTI & CO., INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:RUBIN, NICHOLAS CHARLES;REEL/FRAME:043744/0120 Effective date: 20170928 |
|
FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
AS | Assignment |
Owner name: RIGETTI & CO., INC., CALIFORNIA Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE FILING DATE OF THE APPLICATION INSIDE THE ASSIGNMENT DOCUMENT PREVIOUSLY RECORDED AT REEL: 043744 FRAME: 0120. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT;ASSIGNOR:RUBIN, NICHOLAS CHARLES;REEL/FRAME:044596/0928 Effective date: 20170928 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
AS | Assignment |
Owner name: TRINITY CAPITAL INC., ARIZONA Free format text: INTELLECTUAL PROPERTY SECURITY AGREEMENT;ASSIGNOR:RIGETTI & CO, INC.;REEL/FRAME:055557/0057 Effective date: 20210310 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT RECEIVED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |