Quantum computing device, quantum computing method, and program
The quantum computing device uses projection squeezing and a rotationally symmetric bosonic code to suppress phase errors in bosonic qubits, enhancing quantum computation accuracy.
Patent Information
- Application Number
- PCT/JP2025/017918
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2025-05-16
- Publication Date
- 2026-11-19
AI Technical Summary
Conventional quantum computing techniques have not effectively addressed phase errors in quantum computing, particularly for bosonic qubits.
A quantum computing device employing a projection operator based on projection squeezing to suppress phase errors in bosonic qubits, utilizing a rotationally symmetric bosonic code and projective squeezing to virtually transform error-prone quantum states into error-free states.
The method effectively reduces phase errors in quantum computation, enabling more accurate quantum state manipulation and computation results.
Smart Images

Figure JP2025017918_19112026_PF_FP_ABST
Abstract
Description
Quantum computing device, quantum computing method, and program
[0001] This invention relates to a technique for suppressing quantum errors.
[0002] One method for suppressing quantum errors is called the symmetry expansion method (Non-Patent Documents 1, 2). The symmetry expansion method is a technique that uses the symmetry of the quantum system under consideration to suppress errors. This method expands the projection operator to an ideal quantum state without computational errors using the symmetry operator, and virtually transforms the quantum state with computational errors into an error-free quantum state through post-processing of the computation result, thereby suppressing computational errors.
[0003] Furthermore, Non-Patent Document 3 discloses an error suppression method that utilizes rotational symmetry to suppress errors that alter the number of photons, such as photon loss.
[0004] McClean, Jarrod R., Zhang Jiang, Nicholas C. Rubin, Ryan Babbush, and Hartmut Neven. "Decoding quantum errors with subspace expansions." Nature communications 11, no. 1 (2020): 1-9.Cai, Zhenyu. "Quantum error mitigation using symmetry expansion." Quantum 5 (2021): 548.Endo, Suguru, Yasunari Suzuki, Kento Tsubouchi, Rui Asaoka, Kaoru Yamamoto, Yuichiro Matsuzaki, and Yuuki Tokunaga. "Quantum error mitigation for rotation symmetric bosonic codes with symmetry expansion." arXiv preprint arXiv:2211.06164 (2022).Endo, Suguru, Keitaro Anai, Yuichiro Matsuzaki, Yuuki Tokunaga, and Yasunari Suzuki. "Projective squeezing for translation symmetric bosonic codes." arXiv preprint arXiv:2403.14218 (2024).
[0005] As described above, the symmetry expansion method makes it possible to suppress errors that alter the number of photons, such as photon loss. However, conventional techniques have not proposed any error reduction methods related to phase errors.
[0006] This invention has been made in view of the above points, and aims to provide a technique for reducing phase errors in quantum computing.
[0007] According to the disclosed technology, there is provided a quantum computing device that performs quantum computation on a quantum state of a bosonic qubit, the quantum computing device comprising a quantum computing unit that calculates a quantum computation result corresponding to a quantum state with suppressed phase error by applying a projection operator that suppresses phase error based on a projection squeezing method to a quantum state that has undergone phase error.
[0008] According to the disclosed technology, phase errors in quantum computation can be reduced.
[0009] It is a diagram showing a configuration example of the quantum computing device 300. It is a diagram showing a configuration example for realizing a bosonic qubit. It is a diagram showing a functional configuration example of the quantum computing device 300. It is a conceptual diagram for reducing phase errors. It is for explaining the operation of the quantum computing device 300. It is a diagram showing an example of a quantum circuit. It is a diagram showing an example of a quantum circuit. It is a diagram showing a hardware configuration example of an apparatus.
[0010] Hereinafter, an embodiment of the present invention (the present embodiment) will be described with reference to the drawings. The embodiment described below is merely an example, and the embodiment to which the present invention is applied is not limited to the following embodiment.
[0011] Further, in the description of the following text, for convenience of description, a symbol (for example, ^) intended to be placed above a character (for example, ρ) is described before the character, as in "^ρ". In addition, in the text description, among subscripts / superscripts, subscripts are represented using "_", and superscripts are represented using "^".
[0012] (Example of Overall Configuration of Apparatus) FIG. 1 shows a configuration example of the quantum computing device 300 according to the present embodiment. The "quantum computing device" may also be referred to as a "quantum computer" or a "quantum computing system".
[0013] As shown in Figure 1, the quantum computing device 300 comprises a control device 100 and a quantum processor 200. The control device 100 performs quantum computation by transmitting control signals, etc., to the quantum processor 200 and obtaining computation results (measurement results) from the quantum processor 200. The control device 100 can be implemented, for example, by a classical computer. Hereafter, "computer" means "classical computer".
[0014] The quantum processor 200 has a physical quantum system. In this embodiment, a bosonic qubit capable of performing continuous-quantum quantum computation is used as the quantum system.
[0015] The physical systems used to realize quantum systems are envisioned to include, but are not limited to, microwave photons for realizing bosonic qubits. For example, superconducting circuits, ion traps, quantum dots, etc., may be used as physical systems.
[0016] (Regarding bosonic qubits) Here, we will describe the bosonic qubits that are expected to be used in this embodiment.
[0017] A bosonic qubit can be represented, for example, by the number of microwave photons in a three-dimensional cavity (which may also be called a Fock state). That is, the state of a bosonic qubit can be represented by a superposition of |0〉, |1〉, |2〉, ..., |n〉, corresponding to states where there are 0, 1, 2, ..., n microwave photons in the cavity.
[0018] Manipulating the photon number state in a bosonic qubit is done, for example, by interacting the cavity with a superconducting qubit (e.g., a transmon). This superconducting qubit is called an ancilla qubit (auxiliary qubit).
[0019] One method of encoding bosonic qubits is, for example, |0〉 where the average number of photons is equal and even. L = (1 / √2)(|0〉+|4〉),|1〉 L One way to use `=|2〉` is to represent two states (logical state 0 and logical state 1).
[0020] Figure 2 shows an example configuration for realizing a bosonic qubit when using a cavity. For example, multiple configurations shown in Figure 2 are placed inside the quantum processor 200 shown in Figure 1.
[0021] As shown in Figure 2, this configuration includes a unit 20 equipped with a readout resonator and transmons, and a cavity 10 for confining photons. A bosonic qubit is realized by the photons confined in the cavity 10.
[0022] Hereinafter, unless otherwise specified, "quantum state" refers to the quantum state of a bosonic qubit. In this specification and in the claims, a quantum system capable of continuous-quantum quantum computation may be referred to as a "qubit," similar to a two-level system, or a quantum system capable of continuous-quantum quantum computation may be referred to as a "quantum mode."
[0023] (Example of the functional configuration of the quantum computing device 300) The control device 100 and the quantum processor 200 included in the quantum computing device 300 work in cooperation to realize the functions for quantum computing by the quantum computing device 300.
[0024] Figure 3 shows an example of the functional configuration of the quantum computing device 300 in this embodiment. As shown in Figure 3, the quantum computing device 300 has a quantum state preparation unit 310, a projection probability calculation unit 320, and a quantum computing unit 330. The operation of each unit will be described later. Since the main control for quantum computing is in the control device 100, the functional configuration shown in Figure 3 may be considered as the functional configuration of the control device 100.
[0025] Furthermore, the "quantum state preparation unit 310, projection probability calculation unit 320, and quantum computing unit 330" in the quantum computing device 300 do not need to be located within a single device. For example, the "projection probability calculation unit 320 and quantum computing unit 330" may be located within one device, while the quantum state preparation unit 310 may be located within one or more devices in different locations.
[0026] Furthermore, the bosonic qubit (specifically, the rotation symmetric bosonic code) in the present embodiment is not limited to one using an actual physical system. For example, the bosonic qubit may be on a simulator implemented by software. In this case, the quantum processor 200 functions as a simulator for the bosonic qubit. This simulator may be provided inside the control device 100.
[0027] (Regarding Rotation Symmetric Bosonic Code) In the present embodiment, since the quantum computing device 300 uses a Rotation Symmetric Bosonic Code (RSBC), an outline of the rotation symmetric bosonic code will be described.
[0028] The logical state of the M-th order rotation symmetric bosonic code is expressed by the following equation.
[0029] In the above equation, |Φ〉 is an appropriately selected primitive state. C 0 and C 1 are each a normalized constant, which asymptotically approaches 2M as the number of photons increases. ^N = ^a † ^a is a number operator, and ^a and ^a † are the annihilation operator and the creation operator, respectively.
[0030] The above two logical states are stabilized by the rotation operator ^R M = exp(i(2π / M)^N). ^Z M = ^R 2M = exp(i(π / M)^N) functions as a logical Z operator. In addition, in the Fock basis, the two logical states are expressed as follows.
[0031] In the above equation, c (Φ) i is a probability amplitude dependent on the primitive state |Φ〉. In addition, the state |± M,Φ 〉 = 1 / √2 (|0 M,Φ 〉 ± |1 M,Φ 〉) is expressed by the following.
[0032] (Regarding the method of suppressing phase errors using projective squeezing) In this embodiment, the quantum computer 300 suppresses phase errors using projective squeezing. Projective squeezing itself is disclosed in Non-Patent Documents 3 and 4. In this embodiment, projective squeezing randomly samples operators obtained by linearly combining Gaussian-weighted displacement operators, and post-processing virtually narrows down bosonic errors such as phase fluctuations of bosonic qubits, replacing the expected value with a more ideal error suppression state.
[0033] Specifically, in this embodiment, the quantum computer 300 suppresses the phase error of the bosonic qubit (specifically, the rotationally symmetric bosonic code) using the following operators.
[0034] The operator shown in equation (1) above is an operator that behaves like a projection operator that reduces phase error.
[0035] In equation (1), Γ is a value proportional to the reciprocal of the variance (1 / (2Γ)) of the Gaussian distribution (Gaussian weights) that generates s. Making Γ smaller compresses the phase fluctuations more strongly, but increases the sampling cost.
[0036] D(•) is the displacement operator. s represents the amount of translation. The phase space has an x (position) direction and a p (momentum) direction. In 1 / 2(A+B) on the right-hand side of equation (1), A is the projection that compresses the distribution in the x direction, and B is the projection that compresses the distribution in the p direction.
[0037] Refer to Figure 4 to illustrate the concept of reducing phase error. The left side of Figure 4 shows a bosonic qubit (specifically, a rotationally symmetric bosonic code) subjected to phase error. The right side of Figure 4 shows the above operator applied to the rotationally symmetric bosonic code. ~ P (phase) This shows that the phase error was reduced by applying (Γ).
[0038] Figure 4 visualizes the Wigner function of a rotationally symmetric bosonic code, with the real component (position component) of the phase space plotted horizontally and the imaginary component (momentum component) plotted vertically. The left side of the figure shows how the interference fringes of a rotationally symmetric bosonic code subjected to a phase error are distorted, while the right side of the figure visually shows how the interference fringes are restored by the action of the projection operator in equation (1).
[0039] (Example of operation of quantum computing device 300) In this embodiment, the quantum computing device 300 applies a projection operator to the quantum state ^ρ that has been subjected to a phase error, which reduces the phase error in the rotationally symmetric bosonic code. ~ P phase By applying (Γ), an error-suppressed quantum state ^ρ is obtained, which is expressed by the following equations (2) and (3). QEM To obtain it "virtually".
[0040] Here, "virtually" means that when a quantum algorithm is executed and the expected value of a certain physical quantity is obtained, the density operator ^ρ QEM This means that the same expected value can be obtained as when the input state ^ρ is prepared, and the quantum state ^ρ QEM It's not possible to provide it directly.
[0041] (Operation Flow of Quantum Computing Device 300) Next, an example of operation of the quantum computing device 300 having the functional configuration shown in Figure 3 will be explained following the steps in the flowchart of Figure 5. This example of operation is an example of obtaining a quantum state with reduced phase error using a projection compression method that allows for obtaining an expected value with virtually suppressed errors.
[0042] <S1 (Step 1): Quantum State Preparation> In S1, the quantum state preparation unit 310 prepares the quantum state ^ρ to be input to the quantum circuit. noisy Prepare it. ^ρ noisy This is a state that is subject to noise (phase error). Quantum state ^ρ noisy To prepare means, for example, by controlling the quantum processor 200 by the control device 100, to change the bozonic qubit to a certain quantum state ^ρ noisy The goal is to do that.
[0043] <S2: Projection Probability Calculation> In S102, the projection probability calculation unit 320 calculates the following projection probability p(Γ). At that time, the projection probability is obtained as follows.
[0044] Here, p k is the displacement operator D k This is the probability that it will be sampled. Specifically, the probability is (1 / 2)e -Γs^2 Then D((is) / √2) is sampled, with probability (1 / 2) e -Γs^2 Then D(s / √2) is sampled. More specifically, in the above sample, s is randomly selected from a Gaussian distribution, and then D((is) / √2) or D(s / √2) is selected with the above probability.
[0045] p k´ Displacement operator D k This is the probability that it will be sampled, and the probability is (1 / 2) e -Γs^2 Then D((is) / √2) is sampled, with probability (1 / 2) e -Γs^2 Then D(s / √2) is sampled.
[0046] Figure 6 shows the quantum circuit used by the projection probability calculation unit 320 to calculate the projection probability p(Γ). The quantum circuit shown in Figure 6 uses the auxiliary qubit (upper part of Figure 6). Here, D kk´ The appropriate phase factor e iθ_kk´ Using D k D k † = e iθ_kk´ D kk´ This is a displacement operator that satisfies the following conditions. The black circles indicate control operations that operate only when the qubit is 1. Note that |+> 0 This represents the state in which auxiliary qubit 0 is initialized to |+>=(|0>+|1> / √2).
[0047] The projection probability calculation unit 120 calculates the probability p using the quantum circuit shown in Figure 6. k p k´ Let's sample it. More specifically, the displacement operator D in the quantum circuit in question. k and displacement operator D kk´ However, probability p k p k´ It is sampled there.
[0048] The projection probability calculation unit 320 executes the sampled quantum circuit, measures the Pauli X operator of the auxiliary qubit, and stores the result, which is either +1 or -1. Let this result be r.
[0049] In relation to the sampled quantum circuit, the phase factor e iθ_kk´ There exists. The projection probability calculation unit 320 calculates the phase factor e iθ_kk´ The product of the above result r and re iθ_kk´ Save it.
[0050] The projection probability calculation unit 320 repeats the above process multiple times, re iθ_kk´ The average value < re iθ_kk´ > is calculated. This value is an unbiased estimator of p(Γ). Here, assume there are K input quantum states. In this case, the projection probability calculation unit 320 calculates p(Γ) for each of the K input quantum states. Through this calculation, p 0 (Γ), ..., p K-1 (Γ) is obtained.
[0051] The projection probability calculation unit 320 is p 0 (Γ), ..., p K-1 (Γ) is passed to the quantum computing unit 330. 0 (Γ), ..., p K-1 (Γ) is used for standardization in S3, which will be described later.
[0052] <S3: Quantum Computation> In S3, the quantum computing unit 330 determines the error-suppressed quantum state ^ρ QEM The quantum computing unit 330 performs the corresponding quantum computation. To achieve this, the quantum computing unit 330 uses the quantum circuit shown in Figure 7.
[0053] Figure 7 shows a quantum circuit for obtaining computational results based on error-suppressed quantum states, and illustrates the case where K error-suppressed quantum states are used. The white squares correspond to randomly sampled displacement operators in the quantum circuit of Figure 7. That is, the quantum circuit shown in Figure 7 contains K of the quantum circuits shown in Figure 6. Also, U C This is a quantum circuit that performs the desired quantum computation.
[0054] The quantum computing unit 330 has K input quantum states ^ρ that have been noised and prepared by the quantum state preparation unit 310. 0 ,・・・,ρ^ (K-1) By inputting this into the quantum circuit shown in Figure 7 (a circuit having two sampled displacement operators (two white squares)), the quantum state ^ρ is reached. 0 ,・・・,ρ^ (K-1) A quantum circuit similar to the quantum circuit in Figure 6 described above is applied independently to each of these. As will be explained later, this process is repeated, and two displacement operators (two white squares) are sampled each time iteration.
[0055] The quantum computing unit 330 processes the measurement results of the auxiliary qubits shown in Figure 7 (e.g., the measurement results of the Pauli X operator) using f 0 , f 1 , ..., f K-1 Store it as and its product f 0 ×f 1 ×…×f K-1 Then, the product of the phase factors corresponding to the sampled circuit (shown below) is saved.
[0056] Then, as shown in Figure 7, the quantum computing unit 330 processes the quantum state after applying the displacement operator into a quantum circuit U corresponding to the desired quantum calculation. C After applying the formula, the measurement result o of the physical quantity O is obtained. Then, the quantum computing unit 330 calculates the following value, which is the product of the product of the stored values and o.
[0057] The quantum computing unit 320 repeats the above process multiple times.
[0058] Obtain the average value (see below).
[0059] Then, the quantum computing unit 330, p 0 (Γ) ×…×p K-1 This value is normalized by (Γ), and the normalized result is obtained as an unbiased estimator of the computational result corresponding to the error-suppressed quantum state. In other words, the above average value is p 0 (Γ) ×…×p K-1By dividing by (Γ), we obtain an unbiased estimator of the computational result corresponding to the error-suppressed quantum state.
[0060] (Example of device hardware configuration) The devices described in this embodiment (control device 100, quantum computing device 300, etc.) can all be realized by having a computer execute a program. This computer may be a physical computer or a virtual machine on the cloud.
[0061] In other words, the device can be realized by using hardware resources such as the CPU and memory built into a computer to execute a program corresponding to the processing performed by the device. The program can be recorded on a computer-readable recording medium (such as portable memory), saved, and distributed. It can also be provided via a network, such as the Internet or email.
[0062] Figure 8 shows an example of the hardware configuration of the computer described above. The computer in Figure 8 has a drive device 1000, an auxiliary storage device 1002, a memory device 1003, a CPU 1004, an interface device 1005, a display device 1006, an input device 1007, an output device 1008, etc., all of which are interconnected by a bus BS. The computer may also be equipped with a GPU.
[0063] The program that enables processing on the computer is provided on a recording medium 1001, such as a CD-ROM or memory card. When the recording medium 1001 containing the program is set in the drive device 1000, the program is installed from the recording medium 1001 to the auxiliary storage device 1002 via the drive device 1000. However, the program does not necessarily have to be installed from the recording medium 1001; it may also be downloaded from another computer via a network. The auxiliary storage device 1002 stores the installed program as well as necessary files and data.
[0064] The memory device 1003 reads and stores a program from the auxiliary storage device 1002 when a program startup command is received. The CPU 1004 implements the functions related to the program stored in the memory device 1003. The interface device 1005 is used as an interface for connecting to a network, a quantum processor 200, etc. The display device 1006 displays a GUI (Graphical User Interface) etc. based on the program. The input device 1007 consists of a keyboard and mouse, buttons, or a touch panel etc., and is used to input various operation commands. The output device 1008 outputs the calculation results.
[0065] Furthermore, the functions of the elements disclosed herein may be implemented using circuits or processing circuitry that include general-purpose processors, special-purpose processors, integrated circuits, ASICs (Application Specific Integrated Circuits), FPGAs (Field Programmable Gate Arrays), conventional circuits, and / or combinations thereof that are programmed using one or more programs stored in one or more memories, or otherwise configured to perform the disclosed functions. A processor is considered processing circuitry or circuitry because it includes transistors and other circuits. A processor may be a programmed processor that executes programs stored in memory. In this disclosure, circuits, units, or means are hardware that performs the enumerated functions, or hardware programmed to perform the enumerated functions. Hardware may be any hardware disclosed herein that is programmed or configured to perform the enumerated functions.
[0066] The system includes memory for storing computer programs, which include computer instructions. These computer instructions provide logic and routines that enable hardware (e.g., processing circuitry or circuitry) to perform the methods disclosed herein. The computer programs can be implemented in commonly known forms, such as computer-readable storage media, computer program products, memory devices, recording media such as CD-ROMs and DVDs, and / or memory in FPGAs and ASICs.
[0067] (Effects of the Embodiment) As described above, the technology described in this embodiment makes it possible to reduce phase errors in quantum computing.
[0068] The following additional information is disclosed regarding the embodiments described above.
[0069] <Notes> (Note 1) A quantum computing device that performs quantum computation on the quantum state of a bosonic qubit, comprising a quantum computing unit that calculates a quantum computation result corresponding to a quantum state in which the phase error has been suppressed by applying a projection operator that suppresses the phase error based on the projection compression method to a quantum state in which the phase error has been suppressed. (Note 2) The quantum computing device according to Note 1, further comprising a projection probability calculation unit that applies a first quantum circuit having a displacement operator and an auxiliary qubit sampled with a predetermined probability to a quantum state in which the phase error has been suppressed, measures the Pauli X operator of the auxiliary qubit, repeatedly performs a process of calculating the product of the measurement result and the phase factor, and calculates the average value of the product of the measurement result and the phase factor as an unbiased estimator of the projection probability corresponding to the projection operator. (Note 3) The quantum computing device according to Note 2, wherein the quantum computing unit applies a second quantum circuit having a displacement operator and an auxiliary qubit sampled with a predetermined probability to a quantum state that has suffered a phase error, calculates a first product which is the product of the measurement result of the auxiliary qubit of the second quantum circuit and the phase factor, repeatedly performs the process of calculating a second product which is the product of the measurement result obtained by measuring the quantum state in which a quantum circuit that performs a desired quantum calculation is applied to the quantum state in which the displacement operator in the second quantum circuit is applied and the first product, and normalizes the average value of the second product using the projection probability, thereby calculating the normalized value as an unbiased estimator of the quantum calculation result corresponding to the quantum state in which the phase error is suppressed. (Note 4) A quantum computing method executed by a quantum computing device that performs a quantum calculation on a quantum state of a bozonic qubit, comprising the step of calculating a quantum calculation result corresponding to a quantum state in which the phase error is suppressed by applying a projection operator that suppresses the phase error based on the projection compression method to a quantum state that has suffered a phase error. (Appendix 5) A non-temporary storage medium storing a program for causing a computer to function as a component of a quantum computing device described in any one of Appendix 1 to 3.
[0070] Although this embodiment has been described above, the present invention is not limited to this specific embodiment, and various modifications and changes are possible within the scope of the gist of the invention as described in the claims.
[0071] 100 Control device 200 Quantum processor 300 Quantum computing device 310 Quantum state preparation unit 320 Projection probability calculation unit 330 Quantum computing unit 1000 Drive device 1001 Recording medium 1002 Auxiliary storage device 1003 Memory device 1004 CPU 1005 Interface device 1006 Display device 1007 Input device 1008 Output device
Claims
1. A quantum computing device that performs quantum computation on the quantum state of a bosonic qubit, comprising a quantum computing unit that calculates a quantum computation result corresponding to a quantum state in which the phase error has been suppressed by applying a projection operator that suppresses the phase error based on projection compression to a quantum state that has been subjected to a phase error.
2. The quantum computing apparatus according to claim 1, further comprising a projection probability calculation unit that operates a first quantum circuit having a displacement operator and an auxiliary qubit sampled with a predetermined probability on a quantum state subjected to a phase error, measures the Pauli X operator of the auxiliary qubit, repeatedly performs a process of calculating the product of the measurement result and the phase factor, and calculates the average value of the product of the measurement result and the phase factor as an unbiased estimator of the projection probability corresponding to the projection operator.
3. The quantum computing device according to claim 2, wherein the quantum computing unit applies a second quantum circuit having a displacement operator and an auxiliary qubit sampled with a predetermined probability to a quantum state subjected to a phase error, calculates a first product which is the product of the measurement result of the auxiliary qubit of the second quantum circuit and the phase factor, repeatedly performs the process of calculating a second product which is the product of the measurement result obtained by measuring the quantum state on which a quantum circuit that performs a desired quantum calculation is applied to the quantum state on which the displacement operator in the second quantum circuit is applied and the first product, and normalizes the average value of the second product using the projection probability, thereby calculating the normalized value as an unbiased estimator of the quantum calculation result corresponding to the quantum state in which the phase error is suppressed.
4. A quantum computing method performed by a quantum computing device that performs quantum computation on the quantum state of a bosonic qubit, comprising the step of calculating a quantum computation result corresponding to a quantum state in which the phase error has been suppressed by applying a projection operator that suppresses the phase error based on projection compression to a quantum state that has been subjected to a phase error.
5. A program for causing a computer to function as a component of a quantum computing apparatus according to any one of claims 1 to 3.
