Shraddha Singh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shraddha Singh has a total of 74 co-authors. Here are the top co-authors by number of shared publications:
- Steven M. Girvin
Yale University
5 shared publications - Baptiste Royer
Département de Physique and Institut Quantique Université de Sherbrooke Sherbrooke Québec Canada
3 shared publications - Luigi Frunzio
Yale University
3 shared publications - Alec Eickbusch
Departments of Applied Physics and Physics, Yale University, New Haven, USA
2 shared publications - Benjamin L. Brock
Departments of Applied Physics and Physics, Yale University, New Haven, USA
2 shared publications - Kaavya Sahay
Yale University
2 shared publications
Latest Publications
- Open Access
- 15 October 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (4) , 041018
Non-Abelian Quantum Signal Processing: A Composite Pulse for Fast Analytic Control of Hybrid Oscillator-Qubit Processors
Quantum signal processing (QSP) transforms a unitary parametrized by a classical variable θ into one governed by a polynomial function f ( θ ) . Though quantum mechanics is linear, such highly nonlinear transformations arise naturally from the curvature of the qubit Bloch sphere. This capability underpins many quantum algorithms and enables robust control by decreasing sensitivity to errors in a control parameter, or quantum sensing by increasing sensitivity to variations one seeks to measure. Here, we extend QSP from classical, commuting control parameters to noncommuting quantum operators. We call this new multivariate class . Rather than treating the noncommutativity of quantum control variables as a complication, non-Abelian QSP exploits their richer commutator algebra as a resource for efficient control. A natural setting is hybrid oscillator-qubit systems realized in superconducting and trapped-ion processors, where the control variables can be the noncommuting position and momentum of a quantum harmonic oscillator. We introduce the Gaussian-controlled rotation (GCR), a canonical instance of non-Abelian QSP that cancels the Gaussian quantum-fluctuation error of an oscillator-controlled qubit rotation, matching the robustness of classical composite pulses with a much shorter circuit and an order-of-magnitude lower error. GCR enables fully analytical circuits for preparing squeezed, cat, GKP, and Fock states with performance comparable to state-of-the-art numerically optimized protocols. Building on this primitive, we develop an analytical framework for universal control of GKP bosonic codes, in which logical readout doubles as piecewise gate teleportation, yielding the first high-fidelity, error-mitigated single- and two-qubit logical gates for finite-energy GKP that surpass prior schemes even in the noiseless regime. The same framework supplies midcircuit error detection and extends in closed form to arbitrary lattices, qudits, and multimode codes relevant to the superconducting-circuit experiments now demonstrating beyond-break-even GKP memory. We further apply these ideas to close a key gap in oscillator-assisted quantum phase estimation. Together, these results show that the non-Abelian structure of quantum control operators can provide a practical resource for robust and efficient quantum control, establishing non-Abelian QSP as both a new theoretical framework and an experimentally accessible control paradigm.
- 15 October 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (4) , 041018
Open AccessNon-Abelian Quantum Signal Processing: A Composite Pulse for Fast Analytic Control of Hybrid Oscillator-Qubit Processors
Quantum signal processing (QSP) transforms a unitary parametrized by a classical variable θ into one governed by a polynomial function f ( θ ) . Though quantum mechanics is linear, such highly nonlinear transformations arise naturally from the curvature of the qubit Bloch sphere. This capability underpins many quantum algorithms and enables robust control by decreasing sensitivity to errors in a control parameter, or quantum sensing by increasing sensitivity to variations one seeks to measure. Here, we extend QSP from classical, commuting control parameters to noncommuting quantum operators. We call this new multivariate class . Rather than treating the noncommutativity of quantum control variables as a complication, non-Abelian QSP exploits their richer commutator algebra as a resource for efficient control. A natural setting is hybrid oscillator-qubit systems realized in superconducting and trapped-ion processors, where the control variables can be the noncommuting position and momentum of a quantum harmonic oscillator. We introduce the Gaussian-controlled rotation (GCR), a canonical instance of non-Abelian QSP that cancels the Gaussian quantum-fluctuation error of an oscillator-controlled qubit rotation, matching the robustness of classical composite pulses with a much shorter circuit and an order-of-magnitude lower error. GCR enables fully analytical circuits for preparing squeezed, cat, GKP, and Fock states with performance comparable to state-of-the-art numerically optimized protocols. Building on this primitive, we develop an analytical framework for universal control of GKP bosonic codes, in which logical readout doubles as piecewise gate teleportation, yielding the first high-fidelity, error-mitigated single- and two-qubit logical gates for finite-energy GKP that surpass prior schemes even in the noiseless regime. The same framework supplies midcircuit error detection and extends in closed form to arbitrary lattices, qudits, and multimode codes relevant to the superconducting-circuit experiments now demonstrating beyond-break-even GKP memory. We further apply these ideas to close a key gap in oscillator-assisted quantum phase estimation. Together, these results show that the non-Abelian structure of quantum control operators can provide a practical resource for robust and efficient quantum control, establishing non-Abelian QSP as both a new theoretical framework and an experimentally accessible control paradigm.
- Open Access
- 7 July 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (3)
Fold-transversal surface code cultivation
Magic state cultivation is a state-of-the-art protocol to prepare ultra-high fidelity non-Clifford resource states for universal quantum computation. It offers a significant reduction in spacetime overhead compared to traditional magic state distillation techniques. Cultivation protocols involve measuring a transversal logical Clifford operator on an initial small-distance code and then rapidly growing to a larger-distance code. In this work, we present a new cultivation scheme in which we measure the fold-transversal Hadamard of the unrotated surface code, and leverage unitary techniques to grow within the surface code family. Using both stabilizer and state vector simulations we find that this approach achieves the lowest known spacetime overhead for magic state cultivation. Practical implementation of our protocol is best suited to architectures with nonlocal connectivity, showing the strength of architectures where such connectivity is readily available.
- 7 July 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (3)
Open AccessFold-transversal surface code cultivation
Magic state cultivation is a state-of-the-art protocol to prepare ultra-high fidelity non-Clifford resource states for universal quantum computation. It offers a significant reduction in spacetime overhead compared to traditional magic state distillation techniques. Cultivation protocols involve measuring a transversal logical Clifford operator on an initial small-distance code and then rapidly growing to a larger-distance code. In this work, we present a new cultivation scheme in which we measure the fold-transversal Hadamard of the unrotated surface code, and leverage unitary techniques to grow within the surface code family. Using both stabilizer and state vector simulations we find that this approach achieves the lowest known spacetime overhead for magic state cultivation. Practical implementation of our protocol is best suited to architectures with nonlocal connectivity, showing the strength of architectures where such connectivity is readily available.
- Top Cited PapersOpen Access
- 15 January 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (1)
Characterization of Drive-Induced Unwanted State Transitions in Superconducting Circuits
Microwave drives are essential for implementing control and readout operations in superconducting quantum circuits. However, increasing the drive strength eventually leads to unwanted state transitions which limit the speed and fidelity of such operations. In this work, we systematically investigate such transitions in a fixed-frequency qubit subjected to microwave drives spanning a 9-GHz frequency range. We identify the physical origins of these transitions and classify them into three categories: (1) resonant energy exchange with parasitic two-level systems (TLSs), activated by drive-induced ac-Stark shifts, (2) multiphoton transitions to noncomputational states, intrinsic to the circuit Hamiltonian, and (3) inelastic scattering processes in which the drive causes a state transition in the superconducting circuit, while transferring excess energy to a spurious electromagnetic mode or TLS material defect. We show that the Floquet steady-state simulation, complemented by an electromagnetic simulation of the physical device, accurately predicts the observed transitions that do not involve TLS. Our results provide a comprehensive classification of these transitions and offer mitigation strategies through informed choices of drive frequency as well as improved circuit design.
- 15 January 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (1)
Top Cited PapersOpen AccessCharacterization of Drive-Induced Unwanted State Transitions in Superconducting Circuits
Microwave drives are essential for implementing control and readout operations in superconducting quantum circuits. However, increasing the drive strength eventually leads to unwanted state transitions which limit the speed and fidelity of such operations. In this work, we systematically investigate such transitions in a fixed-frequency qubit subjected to microwave drives spanning a 9-GHz frequency range. We identify the physical origins of these transitions and classify them into three categories: (1) resonant energy exchange with parasitic two-level systems (TLSs), activated by drive-induced ac-Stark shifts, (2) multiphoton transitions to noncomputational states, intrinsic to the circuit Hamiltonian, and (3) inelastic scattering processes in which the drive causes a state transition in the superconducting circuit, while transferring excess energy to a spurious electromagnetic mode or TLS material defect. We show that the Floquet steady-state simulation, complemented by an electromagnetic simulation of the physical device, accurately predicts the observed transitions that do not involve TLS. Our results provide a comprehensive classification of these transitions and offer mitigation strategies through informed choices of drive frequency as well as improved circuit design.
- Top Cited PapersOpen Access
- 7 January 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.
- 7 January 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Top Cited PapersOpen AccessHybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.
- Open Access
- 4 December 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4)
Surface Code with Imperfect Erasure Checks
Recently, significant effort has been devoted towards designing erasure qubits in which dominant physical noise excites detectable leakage states that can be returned to the qubit subspace. Interest in these erasure qubits has been driven by studies showing that the requirements for fault-tolerant quantum error correction are significantly relaxed when noise in every gate operation is dominated by erasures. However, these studies assume perfectly accurate erasure checks after every gate operation which generally come with undesirable time and hardware overhead costs. In this work, we investigate the consequences of using an imperfect but overhead-efficient erasure check for fault-tolerant quantum error correction with the surface code. We show that, under physically reasonable assumptions on the imperfect erasure checks, the threshold error rate is still at least over twice that for Pauli noise. We also study the impact of imperfect erasure checks on the effective error distance and find that it degrades the effective distance under a general error model in which a qubit suffers from depolarizing noise when interacting with a leaked qubit. We then identify a more restrictive but realistic noise model for a qubit that interacts with a leaked qubit, under which the effective error distance is twice that for Pauli noise. We apply our analysis to recently proposed superconducting dual-rail erasure qubits and show that achieving good-performance surface code quantum memories with relaxed system requirements is possible.
- 4 December 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4)
Open AccessSurface Code with Imperfect Erasure Checks
Recently, significant effort has been devoted towards designing erasure qubits in which dominant physical noise excites detectable leakage states that can be returned to the qubit subspace. Interest in these erasure qubits has been driven by studies showing that the requirements for fault-tolerant quantum error correction are significantly relaxed when noise in every gate operation is dominated by erasures. However, these studies assume perfectly accurate erasure checks after every gate operation which generally come with undesirable time and hardware overhead costs. In this work, we investigate the consequences of using an imperfect but overhead-efficient erasure check for fault-tolerant quantum error correction with the surface code. We show that, under physically reasonable assumptions on the imperfect erasure checks, the threshold error rate is still at least over twice that for Pauli noise. We also study the impact of imperfect erasure checks on the effective error distance and find that it degrades the effective distance under a general error model in which a qubit suffers from depolarizing noise when interacting with a leaked qubit. We then identify a more restrictive but realistic noise model for a qubit that interacts with a leaked qubit, under which the effective error distance is twice that for Pauli noise. We apply our analysis to recently proposed superconducting dual-rail erasure qubits and show that achieving good-performance surface code quantum memories with relaxed system requirements is possible.
- Open Access
- 6 October 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4)
Impact of Josephson-Junction Array Modes on Fluxonium Readout
Dispersive readout of superconducting qubits is often limited by readout-drive-induced transitions between qubit levels. While there is a growing understanding of such effects in transmon qubits, the case of highly nonlinear fluxonium qubits is more complex. We theoretically analyze measurement-induced state transitions (MISTs) during the dispersive readout of a fluxonium qubit. We focus on a new mechanism: a simultaneous transition/excitation involving the qubit and an internal mode of the Josephson-junction array in the fluxonium circuit. Using an adiabatic Floquet approach, we show that these new kinds of MIST processes can be relevant when using realistic circuit parameters and relatively low readout drive powers. They also contribute to excess qubit dephasing even after a measurement is complete. In addition to outlining basic mechanisms, we also investigate the dependence of such transitions on the circuit parameters. We find that with a judicious choice of frequency allocations or coupling strengths, these parasitic processes can most likely be avoided.
- 6 October 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4)
Open AccessImpact of Josephson-Junction Array Modes on Fluxonium Readout
Dispersive readout of superconducting qubits is often limited by readout-drive-induced transitions between qubit levels. While there is a growing understanding of such effects in transmon qubits, the case of highly nonlinear fluxonium qubits is more complex. We theoretically analyze measurement-induced state transitions (MISTs) during the dispersive readout of a fluxonium qubit. We focus on a new mechanism: a simultaneous transition/excitation involving the qubit and an internal mode of the Josephson-junction array in the fluxonium circuit. Using an adiabatic Floquet approach, we show that these new kinds of MIST processes can be relevant when using realistic circuit parameters and relatively low readout drive powers. They also contribute to excess qubit dephasing even after a measurement is complete. In addition to outlining basic mechanisms, we also investigate the dependence of such transitions on the circuit parameters. We find that with a judicious choice of frequency allocations or coupling strengths, these parasitic processes can most likely be avoided.
- Top Cited PapersOpen Access
- 14 May 2025
- Published by Springer Nature in Nature
- Vol. 641 (8063) , 612-618
Quantum error correction of qudits beyond break-even
Hilbert space dimension is a key resource for quantum information processing1,2. Not only is a large overall Hilbert space an essential requirement for quantum error correction, but a large local Hilbert space can also be advantageous for realizing gates and algorithms more efficiently3,4,5,6,7. As a result, there has been considerable experimental effort in recent years to develop quantum computing platforms using qudits (d-dimensional quantum systems with d > 2) as the fundamental unit of quantum information8,9,10,11,12,13,14,15,16,17,18,19. Just as with qubits, quantum error correction of these qudits will be necessary in the long run, but so far, error correction of logical qudits has not been demonstrated experimentally. Here we report the experimental realization of an error-corrected logical qutrit (d = 3) and ququart (d = 4), which was achieved with the Gottesman–Kitaev–Preskill bosonic code20. Using a reinforcement learning agent21,22, we optimized the Gottesman–Kitaev–Preskill qutrit (ququart) as a ternary (quaternary) quantum memory and achieved beyond break-even error correction with a gain of 1.82 ± 0.03 (1.87 ± 0.03). This work represents a novel way of leveraging the large Hilbert space of a harmonic oscillator to realize hardware-efficient quantum error correction.
- 14 May 2025
- Published by Springer Nature in Nature
- Vol. 641 (8063) , 612-618
Top Cited PapersOpen AccessQuantum error correction of qudits beyond break-even
Hilbert space dimension is a key resource for quantum information processing1,2. Not only is a large overall Hilbert space an essential requirement for quantum error correction, but a large local Hilbert space can also be advantageous for realizing gates and algorithms more efficiently3,4,5,6,7. As a result, there has been considerable experimental effort in recent years to develop quantum computing platforms using qudits (d-dimensional quantum systems with d > 2) as the fundamental unit of quantum information8,9,10,11,12,13,14,15,16,17,18,19. Just as with qubits, quantum error correction of these qudits will be necessary in the long run, but so far, error correction of logical qudits has not been demonstrated experimentally. Here we report the experimental realization of an error-corrected logical qutrit (d = 3) and ququart (d = 4), which was achieved with the Gottesman–Kitaev–Preskill bosonic code20. Using a reinforcement learning agent21,22, we optimized the Gottesman–Kitaev–Preskill qutrit (ququart) as a ternary (quaternary) quantum memory and achieved beyond break-even error correction with a gain of 1.82 ± 0.03 (1.87 ± 0.03). This work represents a novel way of leveraging the large Hilbert space of a harmonic oscillator to realize hardware-efficient quantum error correction.
- Open Access
Towards a Unified Quantum Protocol Framework: Classification, Implementation, and Use Cases
We present a framework for the unification and standardization of quantum network protocols, making their realization easier and expanding their use cases to a broader range of communities interested in quantum technologies. Our framework is available as an open-source repository, the Quantum Protocol Zoo. We follow a modular approach by identifying two key components: Functionality, which connects real-world applications; and Protocol, which is a set of instructions between two or many parties, at least one of which has a quantum device. Based on the different stages of the quantum internet and use-case in the commercialization of quantum communication, our framework classifies quantum cryptographic functionalities and the various protocol designs implementing these functionalities. Towards this classification, we introduce a novel concept of resource visualization for quantum protocols, which includes two interfaces: one to identify the building blocks for implementing a given protocol and another to identify accessible protocols when certain physical resources or functionalities are available. Such classification provides a hierarchy of quantum protocols based on their use-case and resource allocation. We have identified various valuable tools to improve its representation with a range of techniques, from abstract cryptography to graphical visualizations of the resource hierarchy in quantum networks. We elucidate the structure of the zoo and its primary features in this article to a broader class of quantum information scientists, physicists, computer science theorists and end-users. Since its introduction in 2018, the quantum protocol zoo has been a cornerstone in serving the quantum networks community in its ability to establish the use cases of emerging quantum internet networks. In that spirit we also provide some of the applications of our framework from different perspectives.
Open AccessTowards a Unified Quantum Protocol Framework: Classification, Implementation, and Use Cases
We present a framework for the unification and standardization of quantum network protocols, making their realization easier and expanding their use cases to a broader range of communities interested in quantum technologies. Our framework is available as an open-source repository, the Quantum Protocol Zoo. We follow a modular approach by identifying two key components: Functionality, which connects real-world applications; and Protocol, which is a set of instructions between two or many parties, at least one of which has a quantum device. Based on the different stages of the quantum internet and use-case in the commercialization of quantum communication, our framework classifies quantum cryptographic functionalities and the various protocol designs implementing these functionalities. Towards this classification, we introduce a novel concept of resource visualization for quantum protocols, which includes two interfaces: one to identify the building blocks for implementing a given protocol and another to identify accessible protocols when certain physical resources or functionalities are available. Such classification provides a hierarchy of quantum protocols based on their use-case and resource allocation. We have identified various valuable tools to improve its representation with a range of techniques, from abstract cryptography to graphical visualizations of the resource hierarchy in quantum networks. We elucidate the structure of the zoo and its primary features in this article to a broader class of quantum information scientists, physicists, computer science theorists and end-users. Since its introduction in 2018, the quantum protocol zoo has been a cornerstone in serving the quantum networks community in its ability to establish the use cases of emerging quantum internet networks. In that spirit we also provide some of the applications of our framework from different perspectives.
- Top Cited Papers
- 22 March 2023
- Published by Springer Nature in Nature
- Vol. 616 (7955) , 50-55
Real-time quantum error correction beyond break-even
The ambition of harnessing the quantum for computation is at odds with the fundamental phenomenon of decoherence. The purpose of quantum error correction (QEC) is to counteract the natural tendency of a complex system to decohere. This cooperative process, which requires participation of multiple quantum and classical components, creates a special type of dissipation that removes the entropy caused by the errors faster than the rate at which these errors corrupt the stored quantum information. Previous experimental attempts to engineer such a process1,2,3,4,5,6,7 faced the generation of an excessive number of errors that overwhelmed the error-correcting capability of the process itself. Whether it is practically possible to utilize QEC for extending quantum coherence thus remains an open question. Here we answer it by demonstrating a fully stabilized and error-corrected logical qubit whose quantum coherence is substantially longer than that of all the imperfect quantum components involved in the QEC process, beating the best of them with a coherence gain of G = 2.27 ± 0.07. We achieve this performance by combining innovations in several domains including the fabrication of superconducting quantum circuits and model-free reinforcement learning.
- 22 March 2023
- Published by Springer Nature in Nature
- Vol. 616 (7955) , 50-55
Top Cited PapersReal-time quantum error correction beyond break-even
The ambition of harnessing the quantum for computation is at odds with the fundamental phenomenon of decoherence. The purpose of quantum error correction (QEC) is to counteract the natural tendency of a complex system to decohere. This cooperative process, which requires participation of multiple quantum and classical components, creates a special type of dissipation that removes the entropy caused by the errors faster than the rate at which these errors corrupt the stored quantum information. Previous experimental attempts to engineer such a process1,2,3,4,5,6,7 faced the generation of an excessive number of errors that overwhelmed the error-correcting capability of the process itself. Whether it is practically possible to utilize QEC for extending quantum coherence thus remains an open question. Here we answer it by demonstrating a fully stabilized and error-corrected logical qubit whose quantum coherence is substantially longer than that of all the imperfect quantum components involved in the QEC process, beating the best of them with a coherence gain of G = 2.27 ± 0.07. We achieve this performance by combining innovations in several domains including the fabrication of superconducting quantum circuits and model-free reinforcement learning.
- Top Cited PapersOpen Access
- 5 August 2022
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 3 (3) , 037001
Blueprint for a High-Performance Fluxonium Quantum Processor
Transforming stand-alone qubits into a functional, general-purpose quantum processing unit requires an architecture where many-body quantum entanglement can be generated and controlled in a coherent, modular, and measurable fashion. Electronic circuits promise a well-developed pathway for large-scale integration once a mature library of quantum-compatible elements have been developed. In the domain of superconducting circuits, fluxonium has recently emerged as a promising qubit due to its high-coherence and large anharmonicity, yet its scalability has not been systematically explored. In this work, we present a blueprint for a high-performance fluxonium-based quantum processor that addresses the challenges of frequency crowding, and both quantum and classical crosstalk. The main ingredients of this architecture include high-anharmonicity circuits, multipath couplers to entangle qubits where spurious longitudinal coupling can be nulled, circuit designs that are compatible with multiplexed microwave circuitry, and strongly coupled readout channels that do not require complex, frequency-sculpted elements to maintain coherence. In addition, we explore robust and resource-efficient protocols for quantum logical operations, then perform numerical simulations to validate the expected performance of this proposed processor with respect to gate fidelity, fabrication yield, and logical error suppression. Lastly, we discuss practical considerations to implement the architecture and achieve the anticipated performance.
- 5 August 2022
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 3 (3) , 037001
Top Cited PapersOpen AccessBlueprint for a High-Performance Fluxonium Quantum Processor
Transforming stand-alone qubits into a functional, general-purpose quantum processing unit requires an architecture where many-body quantum entanglement can be generated and controlled in a coherent, modular, and measurable fashion. Electronic circuits promise a well-developed pathway for large-scale integration once a mature library of quantum-compatible elements have been developed. In the domain of superconducting circuits, fluxonium has recently emerged as a promising qubit due to its high-coherence and large anharmonicity, yet its scalability has not been systematically explored. In this work, we present a blueprint for a high-performance fluxonium-based quantum processor that addresses the challenges of frequency crowding, and both quantum and classical crosstalk. The main ingredients of this architecture include high-anharmonicity circuits, multipath couplers to entangle qubits where spurious longitudinal coupling can be nulled, circuit designs that are compatible with multiplexed microwave circuitry, and strongly coupled readout channels that do not require complex, frequency-sculpted elements to maintain coherence. In addition, we explore robust and resource-efficient protocols for quantum logical operations, then perform numerical simulations to validate the expected performance of this proposed processor with respect to gate fidelity, fabrication yield, and logical error suppression. Lastly, we discuss practical considerations to implement the architecture and achieve the anticipated performance.