JP2005513680A6 - Integrated development environment for quantum computing - Google Patents

Abstract

  In a computer program product for use with a computer system, the computer program product comprises a computer-readable storage medium and a computer program mechanism incorporated therein. The computer program mechanism includes a quantum computing integrated development environment (QC-IDE) module and a compiler module. The QC-IDE module is used to design quantum logic for a plurality of qubits. The QC-IDE module includes instructions for generating an operator for time resolution setting. The compiler module includes instructions for compiling a time-resolved setting operator into a set of quantum machine language instructions.

Description

1.0 TECHNICAL FIELD OF THE INVENTION The present invention relates to a quantum computer, and more particularly to a method and apparatus for operation simulation of a quantum computer.

  This invention is a partial succession of US patent application Ser. No. 10 / 028,891 filed Dec. 22, 2001, which is incorporated by reference in its entirety.

2.0 Background 2.1 Qubits A qubit or qubit is a building block of a quantum computer in a manner similar to that a conventional binary bit is a building block of a classical computer. Conventional binary bits typically employ values of 0 and 1. Values of 0 and 1 can be referred to as conventional bit ground states. A qubit is similar to a conventional binary bit in that it can adopt a ground state as well. The ground state of the qubit is referred to as | 0> ground state and | 1> ground state. In quantum computation, the state of a qubit is defined as the superposition of | 0> ground state and | 1> ground state. This means that the state of the qubit has the probability of taking a non-zero | 0> ground state and the probability of taking a non-zero | 1> ground state at the same time. In order to have the probability of taking a non-zero first ground state (| 0>) and the probability of taking a non-zero second ground state (| 1>), the ability of a qubit usually has a value of 0 or 1 Different from bit.

  By nature, the superposition of ground states means that a qubit can exist simultaneously in both ground states | 0> and | 1>. Mathematically, the superposition of the ground state means that the entire state of the qubit represented by | Ψ> is expressed by the following equation.

  | Ψ> = α | 0> + β | 1>

  Here, α and β are probability amplitudes. The terms α and β are a real component and an imaginary component, respectively. Typically, when the state of a qubit is measured (eg, read out), the quantum properties of the qubit are temporarily lost and the superposition of the ground state is either | 0> ground state or | 1> ground state It collapses to one side, thereby resulting in something similar to a conventional bit. The actual state of the qubit after it is collapsed depends on the probability amplitudes α and β immediately before the read operation.

US patent application Ser. No. 09 / 872,495 “Quantum processing system and method for a superconducting phase qubit”

  For a discussion of the qubit operation and control system for realizing quantum computation, reference may be made to Patent Document 1 filed on June 1, 2001, which is incorporated by reference in its entirety.

Mooij et al. , 1999, Science 285, 1036.

2.1.1 Flux qubits There are many physical implementations of qubits. One of the proposals is a superconducting flux qubit. With reference to Non-Patent Document 1, this is incorporated by reference in its entirety. The flux qubit consists of an inner superconducting loop containing three or more Josephson bonds and is inductively coupled to an outer dc-SQUID containing two Josephson bonds. The dc-SQUID induces which bias current can flow. The bias current through induction provides the basis for operating in the inner loop and forms a qubit.

Makhlin et al. , 2001, Rev. Mod. Phys. 73,357

  The Mooij qubit can be biased to adjust the energy phase diagram. This DC bias or flux bias adjusts the relative value of the double well of the energy phase diagram depicting the qubit. Flux qubit coupling is achieved using inductive coupling and induces the interaction between each qubit in the Hamiltonian of the quantum system depicting the coupled flux qubit to sigma x and sigma z. Direct inductive coupling is used to couple flux qubits. For example, referring to Non-Patent Document 2, the whole is incorporated by reference.

Shirman and Schoon, 1998, Phys. Rev. B57 15400

2.1.2 Charge (CHARGE) qubit An example of a charge qubit is the electronic box proposed by NPL 3. The electron box consists of a superconducting island connected by a Josephson coupling to a superconducting electrode having a capacitive coupling C to the gate electrode. Control voltage V _x is applied using the gate capacitor. Josephson coupling is the Josephson energy E _{J (} which is related to the Josephson critical current I _C because E _J = I _C Φ ₀ / 2π and Φ ₀ ≡h / 2e is a flux quantum) and the charging power It is characterized by a capacitance C _J that determines the quantity scale. In this system, the charge in the electronic box and the phase across the junction are typically complex conjugate variables. The system restores the coherer sensitivity if it is not superconducting, ie if the current is kept below I _C. The bit states are the corresponding pseudo-spin variables that satisfy the states | ↓> = | n> and | ↑> = | n + 1>, where n is an integer of the Cooper pair.

Lea et al. and Dykman et al. in Braunstein and Lo (Eds.), 2001, Scalable Quantum Computers, Wiley-VCH Berlin.

2.1.3 Helium electrons Another qubit is the "helium electrons". This kind of qubit's electrons behave like pseudo-single-electron atoms governed by the Bohr model. The wave functions of the first and second excited states are qubit bit states. The first and second excited states in this type of qubit do not degenerate (ie they do not have the same energy). The vertical potential well V (z) α-1 / z confines electrons. The system has a similar behavior for the atomic model with its own Rydberg constant and Bohr radius a _B depending on the helium isotope used. The system is thus similar to the well being studied in mathematical physics. There is an energy transition from the first state where the expected value <z ₀ > = 1.5a _B to the expected vertical position of the second state <z ₁ > = 6a _B. The energy difference is f _r = (E ₁ −E ₀ ) / h in frequency units. Thus, pulses such as those used in NMR studies can be used to transition the states of these individual pseudoatoms. The electrons are arranged in a superlattice structure called a Winger crystal. Each atom is addressable, allowing the conditioning pulse to interact with the atom. The interaction between qubits is described by a Hamiltonian with terms that are proportional to all Pauli matrices and their complex linear combinations. The qubit interactions usually exist but are only modulated to a certain extent. With reference to Non-Patent Document 4, this is all incorporated by reference.

Feynman, 1982, Int. J. et al. Yheor. Phys. 21,467

2.2 Quantum Computing 2.2.1 Quantum Computing Defined Here, research on so-called quantum computing goes back to Richard Feynman. For example, when non-patent document 5 is viewed, the entirety thereof is incorporated by reference. Feynman finds that the quantum system is inherently difficult to simulate using traditional (eg, conventional, non-quantum digital) computers, but this task observes the evaluation of the quantum system under controlled conditions Noted that this can be accomplished by doing Solving the theory of operation of a quantum system commonly involves solving a differential equation for the Hamiltonian of the system. Observation of system operation provides information related to the solution of the equation.

Shor, 1997, SIAM J. et al. of Compute. 26, 1484; Grover, 1996, Proc. 28th STOC, 212 (ACM Press, New York); and Kitaev, LANL print quant-ph / 9511026 Briegel et al. , Preprint quant-ph / 9803056 Knill et al. , 1998, Science 279, 342

  The struggle of quantum computing was initially related to the establishment of formal theories or to extensions to “software development” or other computational problems. The discovery of the Shor algorithm and the Grover algorithm was an important event in quantum computing. For example, looking at Non-Patent Document 6, each of them is hereby incorporated by reference in its entirety. The Shor algorithm enables a quantum computer to effectively factor large natural numbers. Using the Shor algorithm, quantum computers can make all existing “public key” cryptosystems obsolete. In another application of the Shor algorithm, the quantum computer (or even a small device such as a quantum relay) makes the communication channel absolutely secure and in principle the message cannot be intercepted without being destroyed in the process . By looking at Non-Patent Document 7, this is incorporated by reference in its entirety. Fault tolerance quantum computation is theoretically possible, since a practical trial method of realization has been disclosed. For example, Non-Patent Document 8 should be referred to.

Quantum computing generally initializes the state of N qubits (cubits), creates a controlled entanglement between them, and allows these states to evolve And reading the qubit after the state has evolved. Thus, a qubit is the basic building block of a quantum computer. As mentioned above, a qubit is a system that conventionally has two degenerate (ie, equal energy) quantum states with a non-zero probability of being found in other states. Because of this non-zero probability, N qubits may define an initial state that is a combination of 2 ^N conventional states. This initial state evolves, governed by the interactions that qubits have between themselves and the interactions that qubits have, including external influences. This state of evolution of N qubits defines the following computation, in fact 2 ^N simultaneous conventional computations. Reading the state of the qubit after evolution is complete determines the computational result.

US Patent Application No. 5,768,297

2.2.2 Basic Requirements for Realizing Quantum Computing The ability of qubits to employ superposition of its basic states is one underlying capability utilized by quantum computers. However, for use in quantum computers, qubits must be combined with other qubits to form quantum registers. In practice, the capacity of a quantum register representing information increases exponentially with the number of qubits in the quantum register. Computational power and quantum computer properties are known and technically described. For example, see Patent Document 2 by Shor, which is incorporated by reference in its entirety.

DiVicenzo, in Scalable Quantum Computers, chapter 1, 2001, Wiley-VCH Verlag GmbH, Berlin

  In addition to the requirement to couple qubits to quantum registers, DiVicenzo presents a number of requirements necessary to implement a physical system that allows quantum computation. Referring to Non-Patent Document 9, this is incorporated by reference in its entirety. These requirements include the need to initialize the state of the qubit to a simple reference state, the need for long associated decoherence times, the “whole set” of quantum gates, and the qubit specific measurement capacity.

DiVicenzo, in Scalable Quantum Computer, Wiley-VCH, Berlin, 2001, Braunstein and Lo, eds

2.2.3 Quantum Gate Overall Set Requirements As noted above, any physical system that allows quantum computation must provide an entire set of quantum gates, and the state of each bit in the physical system is It can evolve in a controlled manner. Non-Patent Document 10 shows the minimum set of gates required to realize the entire set of quantum gates. Briefly, the entire set of quantum gates includes a single qubit operation as well as at least one two-qubit operation.

A single qubit is considered as a vector | Ψ> = a | 0> + b | 1> parameterized by two complex numbers a and b, and satisfies | a | ² + | b | ² = 1. The qubit's operation must maintain this norm, so the operation is described by a 2 × 2 matrix. The 2 × 2 matrix is a Pauli matrix shown below.

Nielsen and Chuung, 2000, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK

The Pauli matrices σ _x , σ _y , and σ _z are three single qubit operations. For detailed information on the gate, refer to Non-Patent Document 11, which is incorporated by reference in its entirety.

2.2.4 Matrix Set Available for Two-qubit Quantum Computing System FIG. 4 illustrates a set of matrices available for a two-qubit quantum computing system that includes possible states of quantum registers. The matrix 400 illustrates the possible states of a two qubit system that correlates with standard binary notation. The quantum register exists in the superposition of the respective states at the same time and has a certain complex probability γ ₀ , γ ₁ , γ ₂ , and γ ₃ existing in each state. Matrixes 410 and 411 represent a matrix of X operators that operate on the first and second qubits in the quantum register, respectively. Matrixes 420 and 421 represent a matrix of Z operators that operate on the first and second qubits in the quantum register, respectively. Matrixes 430 and 431 represent a matrix of Y operators that operate on the first and second qubits in the quantum register, respectively. Matrix 440 represents a matrix of concatenation operators that operate to concatenate the first and second qubits in the quantum register, and the concatenation operation represents a control phase operation. In an N qubit quantum register, these matrices can be expanded to be a 2 ^N × 2 ^N matrix operating on a corresponding qubit or multiple qubits.

US Pat. No. 5,917,322 Moska, 1998, Nature 393, 344 the number-ordering algorithm of Vandersypen et al. , Preprint quant-ph / 0007017

2.3 Physical System for Realizing Quantum Computing Several physical systems have been proposed for qubits of quantum computers. One qubit system uses molecules with degenerate nuclear spin states. Reference is made to Gerschenfeld and Chuang, US Pat. Nuclear magnetic resonance (NMR) technology can read the spin state. These systems have successfully implemented search algorithms. For example, referring to Non-Patent Document 12, this is incorporated by reference in its entirety. Moreover, when the nonpatent literature 13 is referred, the whole is taken in by this by reference. The number ordering algorithm relates to the quantum Fourier transform, both the Sor factoring algorithm, which is an important element, and the Grover algorithm for searching unordered databases. In addition, proposals for physical systems for quantum computing are described in Section 2.1.

Bettelli et al. 2001, “Toward an architecture for quantum programming”, LANL cs. PL / 0103009v. 2

2.4 Quantum Computing Programming Languages Proposals have been made for quantum computing programming languages and architectures. For example, referring to Non-Patent Document 14, this is incorporated by reference in its entirety. Bettelli investigates possible approaches to the problem of programming quantum computers. The reference provides a template high-level quantum language that uses a set of quantum primitives to supplement a general purpose multipurpose conventional language. The basic scheme involves an execution time environment that calculates the bytecode for the quantum operation and sends it to the quantum device controller or simulator.

  However, Bettilli has failed to address the complexities associated with different physical realizations of quantum computers, thereby bringing quantum computing instructions to the bytecode level required to control quantum computers. It does not teach to reduce. In addition, Bettilli must translate the high-level code into a continuous low-level control instruction for the quantum machine, optionally optimizing, allowing the high-level quantum language to be automated and scalable. It is recognized that this is not the case, but the scalable procedure is not taught in the literature. Furthermore, Bettilli's high-level language is only abstract. It does not provide details on how the language works in an actual physical system. Bettilli, in summary, teaches that a high level programming language cannot drive an actual computing system.

  Furthermore, current quantum simulators are largely based on any physical quantum computing proposal. For example, reference should be made to QuCalc (Paul Dumais, Laboratory for Theoretical and Quantum Computing, University of Montreal). QuCalc is a commonly used mathematical processing package (Wolfram Research Inc., Champaign IL) that simulates quantum computing operations. QuCalc is based on qualitative quantum computation. However, Calc does not consider the constraints, limitations, or characteristics of physical quantum computing systems.

  Given the above background, there is a need in the art for development tools that handle the physical parameters required to operate a quantum computing system and to optimize the instructions executed in the system.

3.0 Summary of the Invention
Design quantum logic using multiple qubits,
Compiling the quantum logic into a set of quantum machine language instructions;
Executing the quantum machine language instruction;
Outputting a result generated by the execution of the quantum machine language instruction;
An integrated development environment and method for quantum computing is provided.
In contrast to prior art systems and methods, the interface of the present invention allows the design and testing of a quantum computing program that takes into account the specific properties of a scalable quantum device and executes the program.

  Designing quantum logic involves selecting a quantum computing system and designing a sequence of basic operators. The set of basic operators depends on the quantum computing system that is selected. In addition, mechanisms for designing quantum logic include defining a sequence of basic operators as an abstract operator (abstract quantum gate) and designing a sequence of abstract operators. In some embodiments of the invention, the mechanism for designing quantum logic includes implementing read operations and defining conditional operations that can be performed based on the desired situation. In one embodiment, the read operation includes implementing a read operation of one or more qubits in the quantum register. The read operation reduces the quantum state of the qubit to a binary equivalent. Conditional actions may include application of basic operators (basic gates) or abstract operators (abstract quantum gates) in one or more qubits of a quantum register. Conditional operations can be applied to one or more reduced or unreduced qubits.

  Further, designing the quantum logic may include setting driver details for the quantum registers. The driver details for the registers depend on the quantum computing system that is selected. The driver details may include parameters such as the minimum duration for the basic operator application or the sharpness of the pulses that can be applied. Further, designing quantum logic may include preparing initial conditions for each qubit in the quantum computing system.

  Compiling quantum logic into a set of quantum machine language instructions involves reducing a set of abstract operators to a set of basic parameters. The mechanism for compiling the quantum machine language instructions may further include reducing the sequence of basic operators according to a set of rules that optimize the basic operators.

  Quantum machine language instructions are executed by a quantum register and are defined by a control system for interacting with the quantum register. The quantum register contains an array of qubits. The basic operation realized in the quantum register is an initialization operation that evolves the state of the quantum register by a set of basic operator applications, and is a read operation. The control system, when specified by a quantum machine language instruction, can interact with the quantum register to adjust each of the respective operations over time. In some embodiments of the invention, quantum machine language instructions are executed by a simulator of a quantum computing system (quantum computer).

  Once the execution of the machine language instruction setting is completed, the quantum register exists in a quantum superposition of its basic state. The superposition is then reduced to a single base state to provide a calculation result. The final state of the quantum computing system after execution of the quantum machine language instruction provides a calculation result.

  Some embodiments of the present invention allow a user to select a desired hardware platform and provide tools to assist in designing machines at the hardware, machine language, logic, and software levels. To do. Embodiments of the present invention allow a user to control each of these situations, providing an “integrated development environment” (IDE) in which all phases of computational engine design are accomplished.

4.0 BRIEF DESCRIPTION OF THE FIGURES FIG. 1 is a system 10 that operates in accordance with one embodiment of the present invention.

  FIG. 2 is a flow diagram illustrating the interaction between elements of a quantum computing integrated development environment according to some embodiments of the invention.

  FIG. 3A is an entity relationship diagram depicting a quantum logic design process according to some embodiments in accordance with the present invention.

  FIG. 3B is a block diagram illustrating the execution element of a quantum computing integrated development environment in accordance with some embodiments of the invention.

  FIG. 3C is a block diagram illustrating output elements of a quantum computing integrated development environment in accordance with some embodiments of the present invention.

  FIG. 4 illustrates the overall basic operations associated with a two-qubit quantum system according to the prior art.

  FIG. 5 is a block diagram of a quantum computing integrated development environment used as a calibration tool for a quantum computing environment in accordance with some embodiments of the present invention.

  6A-6B are examples of interfaces in accordance with the present invention for circuit and machine language design modes for a quantum computing integrated development environment.

  FIG. 7 illustrates another embodiment of a circuit and machine language design mode for a quantum computing integrated development environment.

  8A-8C illustrate various aspects of an example quantum logic design mode in a quantum computing integrated development environment.

  9A and 9B illustrate two embodiments of an execution mode interface.

  FIG. 10 illustrates an example of an abstract quantum gate.

  Similar reference numbers refer to corresponding parts throughout the several views of the figure.

5.0 Detailed Description of the Invention Any sequence of quantum logic can be detailed by basic operations or “gates”. For information on gates, see section 2.2.3 above. Thus, these gates constitute an important part of the quantum machine's quantum machine language, in addition to initialization instructions and read operations. As described in Section 2.2.2, a quantum computing system must provide a basic sequence of quantum operations or basic operators that are unique to the system. To accommodate quantum computing, the quantum system is indicated as "Y" Operation "X" directed by sigma _X operations as operations, sigma _Z operations indicated as "Z" operations below below below It must be designed to provide σ _Y operations, and entanglement operations, or to provide a portion of these operations.

One known quantum computing system is nuclear magnetic resonance (NMR). NMR can achieve all necessary basic operations. Other systems that can achieve all necessary basic operations include flux qubits, charge qubits, and helium electrons. The computational space available for quantum computation increases with the number of qubits cooperating with the system as 2 ^N , where N is the number of qubits in the system. Establishing and designing algorithms for quantum systems is a very complex task because it involves working with a 2 ^N × 2 ^N sized matrix.

5.1 Exemplary System FIG. 1 illustrates a system 10 that operates in accordance with one embodiment of the present invention. The system 10 includes at least one digital (conventional binary) computer 20. The computer 20 includes a central processing unit 22, a memory 24 (including a high-speed random access memory similar to a non-volatile storage device such as the disk 14) for storing program modules and data structures, a user input / output device 26, a disk It includes standard server elements including controller 12, network interface card 16, and one or more buses 34 interconnecting these elements. User input / output device 26 includes one or more user input / output elements such as mouse 36, display 38, and keyboard 8.

  Memory 24 contains a number of modules and data structures used in accordance with the present invention. At some time during system operation, some of the modules and / or data structures stored in memory 24 are stored in random access memory, while another part of the modules and / or data structures is non-volatile. It is recognized that it is stored in the storage device. In the exemplary embodiment, memory 24 includes an operating system 40. The operating system 40 includes processing procedures for handling various basic system services and processing procedures for realizing hardware-dependent tasks.

  In a typical implementation, programs and data stored in the system memory 24 are compiled into quantum computing, an integrated development environment (QC-IDE) module 44 for designing quantum logic, and compiling quantum logic into quantum machine language instructions. , Executing a quantum machine language instruction, and providing an execution result as an output. The QC-IDE 44 is used to develop a quantum algorithm, optimizes the quantum algorithm, and realizes quantum computation. The QC-IDE 44 includes a circuit layout interface module 620, a machine language interface module 610, a pulse amplitude interface module 611, an initial condition interface module 615, a control panel module 630, a global setting interface module 640, a toolbar menu module 650, and a system information interface module. 660. These modules are described in further detail below in conjunction with FIGS. Some embodiments of QC-IDE 44 are used to model quantum systems such as many-body electronic systems, fusion or fission, or protein folding systems and the like. In particular, some embodiments of QC-IDE44 model protein structures, phosphates, and other biological macromolecules as well as determine the interaction forces between macromolecules and organic compounds. Useful for. In addition, the memory 24 includes at least one time-resolved setting operator 48 generated using the QC-IDE module 44. The time resolution setting operator 48 is compiled by the compiler module 50 to form machine language instructions 52, which are then executed by the execution module 54 and output to the device by the output module 56.

  Further, the system 10 includes a quantum computing system 70 that includes a quantum register 72. The quantum register includes a plurality of qubits 74 in order. There is a need for a control system for performing basic operations and a control processor for integrating operations in each qubit of the quantum register. In the system 10, the integrated function is provided as driver hardware 58 of the computer 20.

  Although only one quantum computing system 70 is illustrated in the illustrated system 10, in practice the system 10 has any number of quantum computing systems 10. Further, each quantum computing system 70 in system 10 need not have the same type of qubit or architecture. For example, some quantum computing systems 70 in system 10 include one or more quantum registers 72 that include flux qubits 74, while some quantum computing systems 70 in system 10 include Some include one or more quantum registers 72 including charge qubits 72. In addition, some quantum computing systems 70 in system 10 include one or more quantum registers 72 that are hybrid registers, including, for example, both flux qubits and charge qubits. Driver hardware 58 is used to track the characteristics of each of the quantum computing systems 70 used in system 10, as described in more detail below.

5.2 Processing Flow FIG. 2 is a flowchart of the embodiment of the present invention. The quantum logic design is derived at the design stage 202 using QC-IDE 44. The result is a time-resolved setting for the operator 48, described in further detail below. In the compilation stage 204, the quantum logic (time resolution setting operator 48) derived in the design stage 202 is compiled into a sequence of quantum machine language instructions 52 by the compiler module 50. The instructions 52 include conventional machine language instructions that may be executed by a conventional (eg, digital computer 20) computer, but typically include at least one executable in the quantum computing system 70 (FIG. 1). Contains quantum machine language instructions. In the execution stage 206, the instructions 52 are executed in the quantum computing system 70 and / or the computing system 20. Finally, in the output stage 208, the calculation results are provided as output by the output module 56.

  The quantum computing logic derived at the design stage 202 can be defined as a series of unitary transformations operating in quantum states. The basic operations of quantum computing logic include a set of quantum unitary transformations that a quantum computer can perform. In general, basic operations consist of X, Y, Z, and entanglement operations. In some embodiments, a ground or read operation is included.

  In some embodiments, the method of designing quantum logic at design stage 202 includes creating a time-resolved sequence elementary operator 48, provided to the initial state of quantum system 70, The combination evolves the initial state of quantum system 70 into several final states. In some embodiments, the method of designing quantum logic includes obtaining the output result 208 illustrated in FIG. 2, adjusting the sequence of the basic operator 48 as necessary to obtain the desired quantum logic. The process illustrated in FIG. 2 is repeated until it is executed.

  In accordance with some embodiments of the present invention, designing quantum logic 202 includes controlling the characteristics of driver hardware 58. The driver hardware 58 is a control system for implementing each basic operation of the qubit in the quantum register. Driver hardware 58 includes a time unit setting that defines the resolution or minimum duration of each operation in operation 48 of the time resolution setting. Further, the pulse sharpness in the time-resolved setting of the operator 48 can be calibrated according to the characteristics of the driver hardware 58. The optimal driver setting ultimately depends on the physical characteristics of the quantum computing system 70. For example, U.S. Patent No. 6,057,056 depicts a current pulse having a frequency on the order of gigahertz and an amplitude on the order of nanoamperes, which is incorporated by reference in its entirety. The driver settings 58 may be useful for phase or flux qubits, but other physical systems require different driver settings.

  In some embodiments of the present invention, the target quantum computing system 70 may be selected before the quantum logic 48 is designed. If a targeted quantum computing system 70 is selected, the details of the driver hardware 58 will vary depending on the needs of the platform. However, at any point, the driver details 58 for the platform 70 may be modified to assist in the design of algorithms that are executed on the designed quantum computing platform 70.

  In some embodiments of the present invention, designing quantum logic uses the QC-IDE module 44 to define the number of qubits 74 required and the possible connections between them (basic operators). Including that. Defining the basic operator includes (i) selecting a desired operator sequence, (ii) setting appropriate driver conditions, and (iii) setting the initial state of each qubit 74 in the quantum register 72. (Iv) compiling the sequence of operations into quantum machine language instructions 52; (v) executing the quantum machine language instructions 52 in the quantum computing system 70; and (vi) using the output module 56 to Evaluating the result of the executed sequence. If the calculated output does not meet the desired output, the process is repeated by iteratively redesigning the pulse sequence 48 using the QC-IDE module 44 until the desired result is obtained.

  In some embodiments of the present invention, quantum logic 48 includes one or more abstract quantum gates 1000 (FIG. 10). Each abstract quantum gate 1000 includes a sequence of basic operations (gates) 1002 and driver characteristics 1004. Abstract quantum gate 1000 can be used to design high-level quantum logic 48. Like the sequence of basic operations (gates), each abstract quantum gate 1000 is combined with other abstract quantum gates 1000 to form a sequence of abstract quantum gates, thereby achieving high-level quantum logic 48. In other words, each operation 1002 in the abstract quantum gate 1000 can be a basic operation (gate) or an abstract quantum gate.

  Some embodiments of the invention include creating an abstract quantum gate 1000 and designing high-level quantum logic 48 that includes a sequence of abstract quantum gates 1000. Abstract quantum gate 1000 may operate in a single qubit 74 or multiple qubits 74. In some embodiments, the abstract quantum gate 1000 includes a sequence of abstract quantum gates 1000. This is particularly advantageous for designing complex quantum logic 48 with many qubits 74.

  In some embodiments of the present invention, the abstract quantum gate 1000 establishes the desired sequence of basic operators (eg, the Pauli matrix described in Section 2.2.3 above) and the sequence as the abstract quantum gate 1000. Designed by exporting. Establishing a basic operator (gate) sequence may be accomplished using the QC-IDE module 44. Once a sequence of basic operators (gates) 1002 is designed, the sequence can be defined as a single quantum gate 1000. In some embodiments of the present invention, the abstract quantum gate 1000 can then be used with a high level quantum logic design tool.

  In some embodiments of the present invention, the memory 24 includes one or more libraries of abstract operators 1002 (not shown). The abstract operator 1000 in the library is incorporated into the operator 48 time resolution settings during the design phase 202. Each library of abstract operators corresponds to a specific target quantum computing system 70. In this way, a library of abstract operators can be used to define the characteristics of a given quantum computing system 70. As a result, the quantum computing system 70 in the system 10 can accurately simulate another quantum computing system.

5.2 Introducing Conditional Steps into Quantum Logic One aspect of the present invention provides quantum logic 48 (FIG. 1) that includes a set of conditional actions. These conditions are based on the results of previous read operations of a single qubit 74 or multiple qubits 74. Reading the qubit 74 involves reducing the state of the qubit, the qubit returns a conventional “1” or “0”, and then measures the value of (0 or 1). This aspect of the invention is advantageous because quantum algorithms often require conditional actions based on reading a single qubit 74 or multiple qubits 74. For example, referring to Shor's Patent Document 2, this is incorporated by reference in its entirety. An error decoding operation typically involves reading the state of certain auxiliary qubits 74 to remove possible errors from the information and performing operations on other qubits based on their measurements. Accompany. In addition, readout and subsequent conditional operations are typically used for quantum teleportation. In U.S. Patent No. 6,057,033, decoding a logical quantum state requires measuring two qubits and then performing a NOT quantum operation on the target qubit based on the results of reading the first two qubits. To do.

  In one embodiment according to this aspect of the invention, the quantum operation is performed based on the result of a previous read operation (or set of read operations). This control logic is stored in the time resolution setting of the logic operator 48. In some embodiments, the read operation is implemented in multiple qubits 74 and conditional quantum logic is designed based on the result of the read operation. This conditional logic applies to qubits 74 that maintain a quantum state (ie, qubits that have not undergone a read operation). A set of quantum operations that may be performed based on the readout includes a set of basic operators and / or a set of abstract operators 1000 that are available to each quantum computing system 70.

  Any basic operator or set of defined basic operators is available for the QC-IDE44 module and can be used as the basis for conditional logic. To illustrate, a typical quantum logic design 48 uses three qubits 74. After some evolution of the set of three qubits 74 has occurred, the second and third qubits are read. The set of operators is then applied subject to the result of the read operation as illustrated by the following pseudo code.

if ((readout of qubit2) and (readout of qubit3) are in bit state1)
then apply a quantum operation to qubit [1]
else
continue without applying any quantum operations

  In some embodiments of the present invention, a set of conditional actions may be defined based on a set of read operations at qubit 74 of quantum computing system 70.

5.3 Compiling Operators for Time-Resolved Settings To convert the quantum logic expressed in the form of a set of abstract operators 48 into a set of quantum machine language instructions 52 (FIG. 1), the abstract operation 1002 Must be compiled into a set of basic operators equivalent to. Compiling the quantum logic includes translating a set of abstract operations 1002 into a set of basic operations, and incorporating driver settings into the basic operations to create a set of quantum machine language instructions 52. Yes.

US patent application Ser. No. 09 / 782,886

  Converting the abstract operator 1000 to a set of basic operations involves optimizing the sequence of basic operations. When the decoherence process in the quantum computing system 70 indicates the time required to perform a critically important calculation, the optimization of the set of basic operations is important for the execution of quantum logic. Become. U.S. Pat. No. 6,057,086 is hereby incorporated by reference in its entirety and describes the rules for optimization (reduction) of a set of basic operators. In some embodiments of the present invention, these rules include basic operator exchange, meaningless time unit removal, and redundant pulse sequence removal or replacement of the pulse sequence by a simplified pulse sequence. Yes.

  By exchanging basic operators, quantum gates that do not interfere with each other can eventually overlap or change their order. For example, the X operation in qubit 74-1 does not interfere with the X operation in qubit 74-2, and the time-resolved sequence X (1) X (2) is similar to X (2) X (1). Since the choice of quantum computing system 70 determines which basic operators to exchange, the exchange operation depends on quantum computing system 70. For example, the effect of the coupling operation between two qubits 74 depends on the nature of the coupling, and the coupling order depends on the quantum computing system 70 used.

  Once the desired logic 48 is developed, it can be defined as an abstract quantum operator for the quantum computing system 70. A set of abstract quantum operators can be used to implement high-level quantum logic, such as, for example, a quantum Fourier transform (QFT). For example, referring to Blais, US Pat. This high level quantum algorithm development provides a level of abstraction useful for establishing the complex quantum algorithm. Furthermore, based on the sensitivity of the quantum computing system to possible errors, individual qubit states are encoded as logical qubits, in which multiple physical qubits encode a single qubit state. The state is protected from errors during computation. The algorithm includes aspects similar to the conventional error qualitative algorithm, and for example, see Shor, US Pat.

  If high-level quantum logic 48 is used in the design and a set of abstract operators is translated directly into a set of quantum machine language instructions 52, several inefficient results will occur. For example, in Patent Document 4, a control NOT (CN) gate is defined as the following subsequent basic operation.

In this case, r and s are two qubits 74, and Z and X are as defined in section 2.2.3. This pulse sequence consists of basic quantum gates that can be used in many solid state quantum computing systems. Here, CP _rs gate is entanglement operations between two qubits with Z _T Z _S operation effect. SWAP ₁₂ quantum gate

SWAP ₁₂ = CN ₁₂ CN ₂₁ CN ₁₂

By defining a CN _rs operation between two qubits as an abstract operator, the SWAP _rs operator can be further defined as an abstract quantum operator using a sequence of CN _rs abstract quantum operators. The direct conversion of the sequence described above to the SWAP abstract operator to the basic operator results in some redundancy. With optimization rules such as operator exchange, certain simplifications can be automated depending on some embodiments of the present invention. For example, the CN _rs described above can be _reordered as follows:

In this case, the square brackets juxtapose operators that can be implemented simultaneously, thereby reducing the overall required time and performing the CN _rs operation. Similar reduction results from the basic operator associated with the SWAP extension.

  In some embodiments of the present invention, quantum logic can be designed directly using the basic operators of quantum computing system 70. In this case, the QC-IDE module 44 is used to optimize the basic operator set, and the compilation will combine the driver details with the basic operator set to be performed in the quantum computing system 70. Contains.

  The quantum machine language 52 utilized in the compilation process may vary depending on the target quantum computing system 70. Different quantum computing systems 70 may have different sets of basic operators. A quantum computing system has enough operators to form a whole set. Some embodiments of the present invention may compile quantum logic with a quantum machine language 52 that is unique to a given quantum computing system 70.

5.4 Quantum Machine Language Instructions Once the quantum theory value 48 and driver 58 details are compiled, a set of quantum machine language instructions 52 appears that can be executed. The nature of the machine language instructions 52 depends on the mechanism for executing those instructions. For example, the mechanism for executing the instruction set can be a specific quantum computing system 70 or a simulation of the system specific to the memory 24 of the digital computer 20. Thus, the set of available basic operators varies for each quantum computing system.

  Quantum machine language instruction set 52 may be executed on those quantum computing systems 70 depicted herein. Quantum computing system 70 includes any quantum mechanical system, and a set of fundamental states can be used to calculate according to quantum mechanical principles. A quantum system useful for quantum computing must provide at least some control through the system's information unit or qubit 74. For example, each quantum computing system 70 must be able to initialize the state of qubit 74, implement a series of unitary expansions of qubit 74, and implement read operations in the state of qubit 74. Such a quantum computing system is referred to as a “quantum register 72”, and operations required for quantum computing are applied to a plurality of qubits 74. The quantum register structure 72 is depicted, for example, in US Pat.

5.5 Quantum Logic Design Process FIGS. 3A, 3B and 3C illustrate a quantum logic design process in accordance with various embodiments of the invention. FIG. 3A illustrates an operation sequence design tool found in some embodiments of the QC-IDE module 44. These tools include tools for identifying driver details, identifying initial conditions for quantum computing system 70, and compiling instruction set 48 into instruction set 52 (FIG. 1). In some embodiments of the present invention, the initial condition of qubit 74 in quantum computing system 70 is set to the | 0> state by default.

  The set of quantum machine language instructions 52 dictates which operations will be implemented in the quantum register 72 in a time resolved manner. Once compiled, the quantum machine language instruction 52 is executed by the control system (execution module 54) and driver (driver hardware 58) and displays the control status provided by the quantum register 72 as shown in FIG. 3B. Use. In particular, FIG. 3B shows that the instruction set 52 can be simulated on the digital computer 20 using the simulation module 60. Alternatively, the instruction set 52 can be executed on the quantum computer 70. In some embodiments, the simulation module 60 is a normal differential equation answer program. When the simulation module 60 is used, the superposition of the state of the quantum computing system is prepared based on the input from the initial conditions. Initialization operations available in quantum computer 70 can only initialize qubits to either the | 0> or | 1> states, so initialization for superposition of states is physically unrealistic. is there. However, for simulation purposes, it is sometimes useful to avoid the initialization process and initialize the quantum computing system directly to the desired state.

  FIG. 3C illustrates how the execution result of the quantum machine language instruction 52 is provided as an output. The output usage includes the final state of register 72, such as 0 or 1, depending on the conventional value. Further, in instances where quantum machine language instructions 52 are simulated using simulation module 60, the quantum state evolution of quantum register 72 may be monitored with the concept of comparing the normalized magnitude of state superposition. . The reason why the speculative simulation provides more data than the actual calculation in the quantum computer 70 is that the read operation in the quantum computer 70 reduces the state of the qubit 74 to a conventional “0” or “1” value. . Since physical readout is not required by the simulation module 60, it is not necessary to reduce the quantum state of the simulated qubit and a matrix representing the qubit can be output.

  In some embodiments of the present invention, quantum computing system 70 can only be initialized to a conventional state of either | 0> or | 1>. Thereafter, the system 70 evolves to a superposition of the basic states. In this case, a set of abstract operators is used to provide the quantum logic, and actually put the quantum computing system 70 into a superposition of computationally useful states prior to realizing the desired quantum computation. Evolve.

5.6 Simulating a Quantum System on a Conventional Computer As noted above, in some embodiments of the present invention, a conventional computer 20 designs, compiles, and executes to a quantum computing integrated development environment. Can be used to provide output. Thus, in some embodiments of the present invention, the quantum computing system is simulated using a conventional computer 20.

  The embodiment of the present invention in which a quantum computing system is simulated includes a time-dependent Schrodinger equation (TDSE) in Hilbert space generated by N two-level systems (qubits). Hilbert space represents all possible values of one or more qubits. The Hamiltonian of an N qubit system can be expressed as:

  In this case, the first three terms are Pauli matrices X, Y, and Z combined using driver details Δ and ε, respectively, and the last term is a control phase type that combines between qubits k and m. It is. The effect of entanglement operations depends on the particular embodiment of the invention. States in Hilbert space are labeled in a regular binary format with “qubit 1” usually being the rightmost number and “qubit N” being usually the leftmost.

In some embodiments of the present invention, executing the machine language instruction set 52 includes simulating the quantum computing system 70. The quantum register of the simulated environment evolves the available set of basic operators according to the application. As mentioned above, the evolution of a simulated quantum register can be described by solving a time-dependent Schrodinger equation. The Hamiltonian of the system includes all time-resolved operations of the quantum system, including a sequence of elementary operators similar to potential sources of errors or losses, and is represented by a 2 ^N × 2 ^N matrix, where N is the system Represents the number of qubits. Each of the basic operators is described by a 2 ^N × 2 ^N unitary matrix, each of which correlates with a specific evolution of the quantum register state.

In some embodiments of the present invention, the simulation of the quantum system includes providing a 2 ^N × 2 ^N time-dependent matrix that represents the Hamiltonian of the system to be solved, where N is the system Represents the number of qubits in, and numerically solves the Schrödinger equation using a prepared time-dependent Hamiltonian. A useful data structure for storing Hamiltonian information is the "sparse matrix" data type, where all elements of the Hamiltonian are keyed by row and column matrix input values and stored in a hash table, Each element stores a time-dependent complex number that represents the basic operator being applied. Some of the basic operators have a matrix with inputs only along the diagonal. A useful data structure for these basic operators is the “diagonal matrix” data type, in which case the need for the data type maintains information about the 2 ^N state, which is the number of components along the diagonal Just do it. Since the components are known to become linearly arranged along the diagonal of the matrix, the sparse matrix data structure is effectively reduced. Thus, a Hamiltonian can be generated by adding each matrix to each basic operator applied to the system. In some embodiments of the present invention, potential sources of decoherence are considered and can be further incorporated into the Hamiltonian.

5.7 Calibration of the Quantum System Some embodiments of the present invention may be used to calibrate the quantum computing system 70. The embodiments include (i) initialization of the quantum register 72, (ii) evolution of the register 72 with respect to some superposition of the basic state, (iii) evolution of the state of the quantum register 72, (iv) Includes functionality for reading. This functionality is useful for calibrating a single qubit 74 in quantum register 72. In the calibration, the qubit 74 is initialized and subsequently read to gather information regarding the unique decoherence process in the quantum computing system 70. Further, after initialization, the sequence of basic operators can be applied to the qubit before the read operation is applied. Through a repeated measurement process, the statistical analysis of the particular qubit 74 in the quantum computing system 70 is related to each basic operation applicable to a single qubit 74 of a given quantum computing system 70. Can be incorporated. The processing procedure can be extended to calibration of multiple qubits 74. Furthermore, interaction operators between qubits can be similarly calibrated using the systems and methods of the present invention.

  FIG. 5 illustrates the application of QC-IDE as a calibration tool for a quantum computing environment. State 550 represents the initial state of the quantum register for calibration. This state depends on the number of qubits involved in the calibration. State 550 represents the initial state of the register as prepared by the control system. Typically, a register may begin with several single conventional states rather than several overlapping states. The evolution of the initial state 550 of the quantum computing system is then accomplished at operation 555, where several sequences of basic operators are used to evolve the state of the quantum computing system. Once the basic operator sequence is applied, the read operation 560 may be implemented in a quantum computing system. Thus, the output from the register correlates with the input state and the applied sequence of basic operators and determines information about the quantum system.

5.8 Interface Mode of QC-IDE FIGS. 6 to 8 illustrate various aspects of the interface mode of QC-IDE 44 according to one embodiment of the present invention. FIG. 6A illustrates a circuit layout interface module 620, a machine language interface 610, a pulse amplitude interface 611, an initial condition interface 615, a control panel 630, a global settings interface 640, a toolbar menu 650, and a system information interface 660.

  FIG. 6A illustrates an example of a quantum program that performs a 2-qubit quantum CNOT operation. The quantum CNOT operation includes two qubits (620-1 and 620-2). One of the two qubits operates as a control and the other operates as a target. The CNOT operation requires a coupling mechanism 620-1, 2 between each qubit (FIG. 6A). The circuit illustrated in the circuit layout interface module 620 represents a general quantum computing scheme and can be designed to reflect the physical characteristics of any quantum computing system 70.

The machine language interface 610 in FIG. 6A illustrates an example of a pulse sequence for performing a quantum CNOT operation. The horizontal axis of the chart 613 in the interface 610 represents a time unit, and each number on the horizontal axis represents a continuous period (duration). Each column in chart 613 represents a qubit gate and applies to the qubit being designed. For example, a column 613-1 of the chart 613 indicates “Q1σ _X ”. This means that σ _X is applied to qubit 74-1 in each period in which a pulse appears in column 613-1 of chart 613. A pulse is represented by a vertical line rising in a predetermined column for a predetermined period. For example, there is a pulse in period 2 of column 614 of chart 613. This means that σ _X will be applied to qubit 74-2 during period 2. In the example of FIG. 6A, the CNOT operation is expressed as follows.

CNOT _1,2 = e ^{i3π / 4} X ₂ (π / 2) C _1,2 (π / 2) Z ₂ (π / 2) X ₂ (π / 2) Z ₂ (π / 2) Z ₁ (π / 2) C _1,2 (π / 2)

In this case, X _r (θ) represents a single qubit flip operation applied to qubit r with respect to phase θ, and Z _r is a single qubit phase operation applied to qubit r with respect to phase θ. ^Where C _{r, s} (θ) represents a two-qubit controlled phase operation, entangles the states of qubits r and s again via phase θ, and e ^{i3π / 4} represents the global phase.

Here, the implementation and optimization of quantum CNOT operations are described in detail above. The columns in chart 613 represent from the top X _r (θ), Y _r (θ), Z _r (θ), ground or read operations, and C _{r, s} (θ) operations for qubits 1 and 2, respectively. Yes. Bars in the columns indicate that each gate is changing during the time unit, and represent a pulse of the operation in each qubit. The magnitude of the pulse can be defined in the pulse amplitude interface 611.

  The machine language interface 610 represents a quantum machine language and is executed by the quantum computer 70. Once it is compiled, it contains all relevant information that is important to running the program. In FIG. 6A, hardware settings and pulse details may be defined by accessing the “Settings and Amplitude” button 698 of the driver panel 699 in the machine language interface 610.

  The “Settings and Amplitude” button 698 opens the global setting interface 640 and the pulse amplitude interface 611, respectively. The global settings interface 640 allows the user to control the steepness of the applied pulses. Also, the user can define to operate the time unit. The time unit is illustrated in FIG. 6A as 1.0 nanosecond (ns). The pulse amplitude interface 611 allows the user to set a default region under the applied pulse, allowing freedom for each quantum gate.

The initial condition interface 615 allows the user to prepare the desired initial state for the quantum system 70 by setting the complex state for each qubit 74. The state of qubit 74 is defined as | Q _r > = α | 0> + β | 1>, where α and β are complex numbers having the form a + bi, and a and b are real numbers. Referring to FIG. 6A, the initial condition for qubit Q1 is defined as follows.

  Q1: [(0.49337) + i (0.52027)] | 0> + [(0.34163) + i (0.6076)] | 1>

  The initial condition interface 615 includes a random button for assigning any number to the qubit state. This function is useful in preparing the initial state of quantum register 72 with state superposition to understand the logic of each operation.

  The toolbar 650 allows the user to access standard functions common to the software such as “New”, “Open”, “Save”, and “Help” as well as tools specific to the QC-IDE module 44, and “Cursor” Useful for circuit layout interface modules 620 such as "," additional qubit "and" additional connection ".

  Control panel 630 is an example of an interface that opens and closes the respective interface illustrated in FIG. 6A. In an embodiment of the present invention, the control panel 630 has a closed state that is reduced in size to expand the visible workspace and an open state that is provided and accessible in features and control. FIG. 7 illustrates the open state for the control panel 630.

  System information interface 660A (FIG. 6A) contains information about the circuits and logic being applied. The interface 660A includes the title of the working document, the system type illustrated as System = Generic, and the combined form illustrated as Couplings = Controlled Phase. System information interface 660A allows a user to define the desired quantum computing platform 70 parameters. For example, in some cases, a quantum CNOT operation may be selected for a join operation such as Couplings = CNOT.

  FIG. 6B illustrates an embodiment of the system design interface 660B. The system design interface allows the user to define useful aspects of the system and is further related to the global settings interface 640 and the system information interface 660A from FIG. 6A.

  FIG. 7 illustrates an example of creating a quantum gate using the logic design interface of the QC-IDE module 44. As illustrated in FIG. 6A, circuit layout interface module 620 and machine language interface 610 are used to define a basic sequence of pulses that perform a set of logic 48 in quantum computer 70. The chart 630 of the machine language interface 610 in FIG. 7 illustrates quantum CNOT operation. FIG. 7 illustrates an example of an export library element interface 670 that converts a machine language sequence such as a single quantum logic gate for use in a logic design interface (an example is illustrated in FIG. 8A). Used to define and export. The export library element interface 670 includes a text area 671 for a file name, a display 672 of an icon to be used for the library element, a button 673 for selecting a desired icon to be used, and a text area for the title of the library element. 674, includes a text area 675 depicting library elements, and some text 676 depicting system information for the library elements. Library element titles, descriptions, and icons can be used to carry information in the logical design interface.

  Further, FIG. 7 illustrates an example of the open mode of the control panel 630. The control panel 630 example illustrated in FIG. 7 includes an OS button that displays the machine language interface 610, a condition button that displays the initial condition interface 615 of FIG. 6, and a compiled and executed result for each machine language. It includes an execution mode button for display (an example of an execution mode interface is described in FIGS. 9A and 9B).

  FIG. 8A illustrates an example of a logic design interface 780. The logic design interface 780 allows the user to design high level quantum logic using standard quantum circuit representations. The qubits are represented in horizontal columns that represent the passage of time from left to right. In some embodiments, a quantum logic gate is added to each of the qubit lines by clicking on the respective time step and qubit line. In some embodiments of the present invention, a drop-down menu appears displaying a list of library elements by right-clicking the mouse pointer on each qubit line at the desired location. An example of a drop-down menu 781 is a list of available library elements and is illustrated in FIG. 8A.

  The logic design interface 780 of FIG. 8A illustrates an example of a quantum teleportation circuit in which the initial state of qubit Q1 is teleported to qubit Q3. Quantum teleportation circuits are well known. For example, p. 26-28, incorporated herein by reference. As illustrated, the teleportation circuit comprises a quantum circuit that includes Hadamard and CNOT operations similar to read, X, and Z operations.

  Referring again to FIGS. 6 and 7, the quantum CNOT operation may include a sequence of basic pulses or a machine language operation. Since a single logic gate of logic design interface 780 may represent multiple basic pulses, a single time unit may also represent multiple time units. In some embodiments, the single time unit of the logical design interface 780 represents five basic time units. The length of the time chart (control chronology) for the qubits in the logic design interface 780 can be controlled by a length button 782.

  The teleportation circuit illustrated in logic design interface 780 includes read operations on qubits Q1 and Q2. The value resulting from the respective read operation follows | 1>, after which further the gate is applied to the target qubit Q3 (FIG. 8A). For example, referring again to FIG. 8A, the X and Z logic gates applied to qubit Q1 are conditional operations based on the value of the read operation performed on qubits Q1 and Q2. If a read operation in qubit Q2 results in a value of | 1>, then an X operation is applied to qubit Q1, and if a read operation in qubit Q1 results in a value of | 1>, then a Z operation Applies to Q1. These conditional operations are accomplished by selections made with the conditional option in drop-down menu 781 in the quantum circuit illustrated in FIG. 8A. In one embodiment of the present invention, the condition option in drop-down menu 781 appears only when the user opens drop-down menu 781 in a read operation. The conditional operation of the quantum circuit in the present invention is described in detail in section 5.2 above.

  FIG. 8B illustrates a ground condition interface 782 where any form of conventional logic can be applied to the result of a read operation. For example, the statement illustrated in FIG. 8B is read in pseudocode as follows:

IF (Ground on quibit Q2 at time unit5 results in | 1>),
then (apply X operation on qubit Q3 at time unit 6).

  FIG. 8C illustrates an example of a control statement browser interface 783 where the user displays conditional logic statements that apply to each quantum circuit. Referring to the quantum circuit illustrated in FIG. 8A, the embodiment of the present invention includes two conditional operations, each based on a read operation in qubits Q1 and Q2, respectively, as shown in FIG. 8C as cond1 and cond2 in the left panel. Illustrated in. In an embodiment, if one of the conditions of each circuit is selected, the conditional logic of the condition appears in the main panel of the control statement browser interface 783. FIG. 8C illustrates a conditional logic example of cond2 from the teleportation circuit illustrated in FIG. 8A.

  FIG. 9A illustrates an embodiment of an execution mode interface 800 (output mode 56 of FIG. 1) that includes an execution console interface 835, a final state interface 891, an OS interface 892, and a state amplitude interface 893. The execution mode interface 800 is an embodiment of the output result interface illustrated as element 208 in FIG. 2 and is used to display the execution of quantum logic. In an embodiment, the execution console interface 835 operates as the main control interface for displaying and reviewing the execution of calculations. The execution console interface 835 may include a plot display panel 835-1 that displays various output interfaces and a time control panel 835-2 that controls the position of the time console that assists in displaying and recognizing the output results. Both the state amplitude interface 893 and the final state interface 891 are examples of interfaces that display quantum logic execution results, and the OS interface 892 can be used to compare the results for logic input pulses or machine language.

  In some embodiments of the present invention, final state interface 891 (FIG. 9A) has three elements: (i) initial state of quantum register 72, (ii) value of quantum register 72 in the time console, and (iii) The final state of the quantum register 72 after calculation is included. Changing the position of the time console changes the corresponding information stored in the quantum register 72. This intermediate value is useful for tracking quantum logic through execution. The state amplitude interface 893 provides a graphical representation of the information in the quantum register 72 in the form of plotting the state population against time. The output illustrated in FIG. 9A at the state amplitude interface 893 illustrates an example of a quantum CNOT operation applied between two qubits having arbitrary initial states. Following the state line at state amplitude interface 893, states 893-01 and 893-11 corresponding to quantum states | 01> and | 11> respectively exchange probabilities while quantum states | 00> and | 10> respectively. The corresponding states 893-00 and 893-10 demonstrate that the probability does not change. This demonstrates the CNOT logic when the control qubit is Q1 and the target qubit is Q2, so that the state is displayed as | Q2Q1 |.

FIG. 9B illustrates another embodiment of the execution mode interface 800. The execution mode interface 800 of FIG. 9B illustrates an example of output from a quantum teleportation circuit, such as the illustrated logical design interface 780 of FIG. 8A. The run mode interface 800 (FIG. 9B) includes a final state interface 891-1 and an intermediate state interface 891-2, and is similar to the final state interface 891 illustrated in FIG. 9A. Final state interface 891-1 and intermediate state interface 891-2 include final global phase panels 891-1-P and 891-2-P, respectively, to bring the global phase defined by the user into the final state of the quantum register. Apply. For example, if the intermediate state interface illustrates a global phase of ^{eiπ / 2} , the number 1.570796 is entered by the user and in this example represents π / 2 and is applied to the final state of the quantum register. Thus, the final output can take the same form as the initial state of the quantum register. In the example of the teleportation circuit illustrated in FIG. 8A, the state information stored in qubit Q1 is transformed to qubit Q3, and the state is represented by | Q3Q2Q1>. In the example of the teleportation circuit, the final states of qubit Q1 and qubit Q2 are not important.

  The present invention may be implemented as a computer program product that includes a computer program mechanism embedded in a computer readable storage medium. For example, a computer program product may include the program module shown in FIG. These program modules are stored on a CD-ROM, magnetic disk storage product, or any other computer readable data or program storage product. Also, software modules in a computer program product can be electronically delivered via transmission of carrier waves of computer data signals (incorporating software modules) over the Internet or others. Also, the software modules of the computer program product can be distributed by hard copy printout or other means.

  While this invention has been described with reference to several specific embodiments, the depictions are illustrative of the invention and are not to be construed as limiting the invention. Various modifications will occur to those skilled in the art without departing from the true spirit and scope of the invention as defined by the appended claims.

1 is a system 10 that operates in accordance with one embodiment of the present invention. FIG. 2 is a flow diagram illustrating the interaction between elements of a quantum computing integrated development environment in accordance with some embodiments according to the invention. FIG. 3 is an entity relationship diagram depicting a quantum logic design process in accordance with some embodiments of the present invention. FIG. 3 is a block diagram illustrating an execution element of a quantum computing integrated development environment, according to some embodiments according to the invention. FIG. 3 is a block diagram illustrating output elements of a quantum computing integrated development environment in accordance with some embodiments of the invention. 1 illustrates the overall basic operations associated with a two-qubit quantum system according to the prior art. 1 is a block diagram of a quantum computing integrated development environment used as a calibration tool for a quantum computing environment, in accordance with some embodiments of the present invention. FIG. 5 is an example of an interface according to the present invention for circuit and machine language design modes for a quantum computing integrated development environment. FIG. FIG. 5 is an example of an interface according to the present invention for circuit and machine language design modes for a quantum computing integrated development environment. FIG. Another embodiment of the circuit and machine language design mode will be described for the quantum computing integrated development environment. Fig. 4 illustrates various aspects of an embodiment of a quantum logic design mode in a quantum computing integrated development environment. Fig. 4 illustrates various aspects of an embodiment of a quantum logic design mode in a quantum computing integrated development environment. Fig. 4 illustrates various aspects of an embodiment of a quantum logic design mode in a quantum computing integrated development environment. Two embodiments of the execution mode interface are described. Two embodiments of the execution mode interface are described. An embodiment of an abstract quantum gate will be described.

Claims (34)

A computer program product for use with a computer system,
The computer program product comprises a computer-readable storage medium and a computer program mechanism incorporated therein,
The computer program mechanism is
A quantum computing integrated development environment (QC-IDE) module for designing quantum logic for a plurality of qubits, the QC-IDE module including instructions for generating an operator for time-resolved setting;
A compiler module for compiling quantum logic, the compiler module for compiling the time-resolved setting operator into a set of quantum machine language instructions;
A computer program product comprising: The set of quantum machine language instructions includes a set of hardware-executable instructions;
The computer program product of claim 1, wherein at least one instruction in the set of hardware-executable instructions can be executed only in a quantum computer.   The computer program product of claim 2, wherein the set of quantum machine language instructions further comprises instructions executable on a conventional computer.   The computer program product of claim 1, wherein the time resolution setting of an operator includes a sequence of basic operators.   The computer program product of claim 4, wherein the sequence of basic operators includes all possible unitary transformations for a given quantum computer.   6. The computer program product according to claim 5, wherein the predetermined quantum computer is a quantum system capable of executing each operator in a whole set of unitary operators. The sequence of basic operators is depicted by a 2 ^N × 2 ^N unitary matrix,
5. The computer program product of claim 4, wherein N is the number of qubits in the quantum computer used to execute the basic operator. One basic operator of the sequence of basic operators is a unitary matrix

The computer program product of claim 4, wherein the computer program product is represented by: One basic operator of the sequence of basic operators is a unitary matrix

The computer program product of claim 4, wherein the computer program product is represented by: One basic operator of the sequence of basic operators is a unitary matrix

The computer program product of claim 4, wherein the computer program product is represented by:   5. The computer program product of claim 4, wherein one basic operator of the sequence of basic operators applies to a single qubit in the quantum computer.   The computer program product of claim 4, wherein one basic operator of the sequence of basic operators is applied to a plurality of qubits.   The computer program product of claim 1, wherein the QC-IDE module further includes instructions for defining a sequence of basic quantum gates as a single abstract quantum gate included in the operator of the time resolution setting. Product.   The computer program product of claim 1, wherein the QC-IDE module includes instructions for defining a sequence of abstract quantum gates as a single abstract quantum gate included in an operator of the time-resolved setting. .   The computer program product according to claim 1, wherein the QC-IDE module includes an instruction for setting a driver specification of a quantum computer.   The computer program product of claim 1, wherein the QC-IDE module includes instructions for setting a frequency of a basic operator to an operator of the time resolution setting. The command for setting the frequency of the basic operator in the operator of the time resolution setting is:
A command for setting the sharpness of each pulse in the basic operator;
A command for setting the amplitude of each pulse in the basic operator;
The computer program product of claim 16, further comprising:   The computer program product of claim 1, wherein the QC-IDE module includes instructions for independently setting the frequency of each basic operator in the time-resolved setting operator.   The computer program product of claim 1, wherein the QC-IDE module includes selecting a quantum computing system to execute all or part of the set of quantum machine language instructions.   The computer program product of claim 1, wherein the QC-IDE module includes instructions for defining a quantum computing system.   The computer program product of claim 20, wherein the instructions for defining a quantum computing system include instructions for specifying a set of basic operations that can be performed by the quantum computing system.   The computer program product of claim 20, wherein the instructions for defining a quantum computing system include instructions for identifying noise in the quantum computing system.   The computer program product of claim 20, wherein the instructions for defining a quantum computing system include instructions for defining a driver specification for the quantum computing system.   The computer program product of claim 1, wherein the QC-IDE module includes instructions for converting an abstract quantum gate in the time-resolved setting of an operator into a sequence of basic operators.   The computer program product of claim 24, wherein the instructions for conversion use a set of simplification rules.   26. The computer program product of claim 25, wherein one simplified rule of the set of simplified rules is a basic operator exchange.   26. The computer program product of claim 25, wherein one simplified rule of the set of simplified rules is removal of redundancy between a first basic operator and a second basic operator. Product.   25. The computer program product of claim 24, wherein the instructions for conversion include instructions for displaying an abstract operator in the time-resolved setting of an operator as an equivalent sequence of basic operators. A method for quantum computing comprising:
A design of quantum logic for a plurality of qubits comprising generating an operator for time-resolved setting;
Compiling the time-resolved setting of the operator into a set of quantum machine language instructions;
A method comprising: The method
Executing the quantum machine language instruction in a quantum computing system; and outputting a result of execution of the quantum machine language instruction;
30. The method of claim 29, further comprising:   The method of claim 29, wherein the quantum machine language instruction models a quantum system.   32. The method of claim 31, wherein the quantum system is a multi-body electronic system, nuclear fusion, dissolved protein, dissolved nucleic acid, or an interaction between a polymer and an organic compound. A computer program product for use with a computer system,
The computer program product comprises a computer-readable storage medium and a computer program mechanism incorporated therein,
The computer program mechanism is
A quantum computing integrated development environment (QC-IDE) module for designing quantum logic for a plurality of qubits, the QC-IDE module including instructions for generating an operator for time-resolved setting;
A compiler module for compiling quantum logic, the compiler module for compiling the time-resolved setting operator into a set of quantum machine language instructions;
A computer program product comprising: A computer system for designing quantum logic,
A central processing unit;
A memory connected to the central processing unit for storing a quantum computing integrated development environment (QC-IDE) module and a compiler module;
The quantum computing integrated development environment (QC-IDE) module including instructions for generating an operator for time-resolved settings;
The compiler module including instructions for compiling the time-resolved operator into a set of quantum machine language instructions;
Computer system equipped with.

Images