# US 12,182,660 B2 · Multi-state qubit readout with permutation sequences > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,182,660 B2 - Document ID: US12182660B2 - Status: Granted - Kind: B2 - Application number: 18/483,758 - Filed: 2023-10-10 - Published: 2024-04-11 - Granted: 2024-12-31 - Earliest claimed: 2019-12-03 - Assignees: Google Inc. - Applicants: Google LLC - Inventors: Kevin Joseph Satzinger; Julian Shaw Kelly; Paul Victor Klimov; Alexander Nikolaevich Korotkov - Web page: https://patentgrep.com/patent/US12182660B2 ## CPC - G06N 10/00: Quantum computing, i.e. information processing based on quantum-mechanical phenomena - B82Y 10/00: Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic - G06F 15/16: Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs {(coordinating program control therefor G06F9/52; in regulating and control system G05B)} - G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation - G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers - G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS - B82Y: SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Systems and methods for measuring quantum states of qubits with more than two levels are provided. A method can include, for a plurality of shuffling sequences, applying, by a quantum computer, one or more quantum gates to the one or more qubits to execute a quantum algorithm; applying, by the quantum computer, a shuffling sequence to the one or more qubits; and measuring, using a readout apparatus, the state of the one or more qubits to determine a readout state. The method can further include determining, by a classical computer or the quantum computer, an average occupation for one or more of the quantum states of the one or more qubits using the readout states for each of the shuffling sequences. The readout states can correspond to a state in a subset of the quantum states of the one or more qubits. ## Claims ### Claim 1 A method for determining an average occupation of quantum states of a plurality of qubits in a quantum computer, each qubit being subject to a set of quantum states that includes at least three quantum states, the method comprising: performing, by the quantum computer, a plurality of shuffling sequences on the plurality of qubits, wherein each shuffling sequence of the plurality of shuffling sequences includes measuring the quantum state of each qubit of the plurality of qubits subsequent to exchanging the quantum state of at least two qubits of the plurality of qubits; and subsequent to performing the plurality of shuffling sequences, determining, by a classical computer or the quantum computer, an average occupation for each quantum state of the set of quantum states based on the measured quantum state of each qubit of the plurality of qubits of each shuffling sequence of the plurality of shuffling sequences. ### Claim 2 (depends on 1) The method of claim 1, wherein each shuffling state of the plurality of shuffling states comprises: applying, by the quantum computer, one or more quantum gates to the one or more qubits to execute a quantum algorithm; applying, by the quantum computer, a shuffling sequence to the one or more qubits; and measuring, using a readout apparatus of the quantum computer, the quantum state of each qubit of the plurality of qubits to determine a readout state. ### Claim 3 (depends on 2) The method of claim 2, wherein determining the average occupation for each quantum state of the set of quantum states is further based on qubits using the readout states for each of the shuffling sequences. ### Claim 4 (depends on 2) The method of claim 2, wherein the readout states of each shuffling sequence of the plurality of shuffling sequences corresponds to a state in the set of the quantum states. ### Claim 5 (depends on 2) The method of claim 2, wherein the readout state of each of the plurality of shuffling sequences corresponds to a state in a computational subspace. ### Claim 6 (depends on 1) The method of claim 1, wherein the plurality of shuffling sequences comprises one or more sequences for exchanging the population of two or more quantum states in the one or more qubits. ### Claim 7 (depends on 1) The method of claim 1, wherein the plurality of shuffling sequences comprises an identity sequence. ### Claim 8 (depends on 1) The method of claim 1, the method further comprising determining, by the classical computer or the quantum computer, leakage from computational states of the plurality of qubits to non-computational states of the plurality of qubits using the average occupation for each quantum state of the set of quantum states. ### Claim 9 (depends on 8) The method of claim 8, the method further comprising adjusting, based on the determined leakage, control parameters of the set of quantum gates to reduce leakage from computational states of the plurality of qubits to non-computational states of the plurality of qubits. ### Claim 10 (depends on 1) The method of claim 1, wherein the method further comprises: preparing the plurality of qubits in a known quantum state of the set of quantum states; measuring, using a readout apparatus of the quantum computer, the quantum state of each qubit of the plurality of qubits to determine a calibration readout state; and determining, by the classical computer or the quantum computer, calibration values based on the calibration readout state, wherein determining an average occupation for one or more of the quantum states of the plurality of qubits is further based on the calibration values. ### Claim 11 (depends on 10) The method of claim 10, wherein the method further comprises: for each of the plurality of shuffling sequences: preparing the plurality of qubits in a known quantum state of the set of quantum states; applying, by the quantum computer, a shuffling sequence to plurality of qubits; and measuring, using a readout apparatus, the quantum state of each qubit of the plurality of qubits to determine a further calibration readout state, wherein determining the calibration values is further based on the further calibration values. ### Claim 12 (depends on 10) The method of any of claim 10, wherein determining the average occupation for each quantum state of the set of quantum states comprises the use of a least squares method or a maximum likelihood method. ### Claim 13 (depends on 1) The method of claim 1, wherein performing each shuffling sequence of the plurality of shuffling sequences comprises applying one or more microwave pulses to the plurality of qubits. ### Claim 14 (depends on 13) The method of claim 13, wherein the one or more microwave pulses each exchanges amplitudes of neighbouring quantum states of the plurality of qubits. ### Claim 15 A system comprising: a plurality of qubits, each qubit of the plurality of qubits being subject to a set of quantum states that includes at least three quantum states; readout apparatus configured to measure a quantum state of the plurality of qubits; wherein the system is configured to: perform a plurality of shuffling sequences on the plurality of qubits, wherein each shuffling sequence of the plurality of shuffling sequences includes employing the readout apparatus to measure the quantum state of each qubit of the plurality of qubits subsequent to exchanging the quantum state of at least two qubits of the plurality of qubits; and subsequent to performing the plurality of shuffling sequences, determine an average occupation for each quantum state of the set of quantum states based on the measured quantum state of each qubit of the plurality of qubits of each shuffling sequence of the plurality of shuffling sequences. ### Claim 16 (depends on 13) The system of claim 13, wherein each shuffling state of the plurality of shuffling states comprises: applying, by the quantum computer, one or more quantum gates to the one or more qubits to execute a quantum algorithm; applying, by the quantum computer, a shuffling sequence to the one or more qubits; and measuring, using a readout apparatus of the quantum computer, the quantum state of each qubit of the plurality of qubits to determine a readout state. ### Claim 17 (depends on 16) The system of claim 16, wherein determining the average occupation for each quantum state of the set of quantum states is further based on qubits using the readout states for each of the shuffling sequence. ### Claim 18 (depends on 16) The system of claim 16, wherein the readout states of each shuffling sequence of the plurality of shuffling sequences corresponds to a state in the set of the quantum states. ### Claim 19 (depends on 16) The system of claim 16, wherein the readout state of each of the plurality of shuffling sequences corresponds to a state in a computational subspace. ### Claim 20 (depends on 15) The system of claim 15, wherein the plurality of shuffling sequences comprises one or more sequences for exchanging the population of two or more quantum states in the one or more qubits as currently presented appears below.