Superconducting qubits provide a promising approach to large-scale fault-tolerant quantum computing. However, qubit connectivity on a planar surface is typically restricted to only a few neighboring qubits. Achieving longer-range and more flexible connectivity, which is particularly appealing in light of recent developments in error-correcting codes, however, usually involves complex multilayer packaging and external cabling, which is resource intensive and can impose fidelity limitations. Here, we propose and realize a high-speed on-chip quantum processor that supports reconfigurable all-to-all coupling with a large on-off ratio. We implement the design in a four-node quantum processor, built with a modular design comprising a wiring substrate coupled to two separate qubit-bearing substrates, each including two single-qubit nodes. We use this device to demonstrate reconfigurable controlled- gates across all qubit pairs, with a benchmarked average fidelity of and best fidelity of , limited mainly by dephasing in the qubits. We also generate multiqubit entanglement, distributed across the separate modules, demonstrating GHZ-3 and GHZ-4 states with fidelities of and , respectively. This approach promises efficient scaling to larger-scale quantum circuits and offers a pathway for implementing quantum algorithms and error-correction schemes that benefit from enhanced qubit connectivity. Published by the American Physical Society2024
more »
« less
This content will become publicly available on April 21, 2026
Multivariate fidelities
The bivariate classical fidelity is a widely used measure of the similarity of two probability distributions. There exist a few extensions of the notion of the bivariate classical fidelity to more than two probability distributions; herein we call these extensions multivariate classical fidelities, with some examples being the Matusita multivariate fidelity and the average pairwise fidelity. Hitherto, quantum generalizations of multivariate classical fidelities have not been systematically explored, even though there are several well known generalizations of the bivariate classical fidelity to quantum states, such as the Uhlmann and Holevo fidelities. The main contribution of our paper is to introduce a number of multivariate quantum fidelities and show that they satisfy several desirable properties that are natural extensions of those of the Uhlmann and Holevo fidelities. We propose several variants that reduce to the average pairwise fidelity for commuting states, including the average pairwisez-fidelities, the multivariate semi-definite programming (SDP) fidelity, and a multivariate fidelity inspired by an existing secrecy measure. The second one is obtained by extending the SDP formulation of the Uhlmann fidelity to more than two states. All of these variants satisfy the following properties: (i) reduction to multivariate classical fidelities for commuting states, (ii) the data-processing inequality, (iii) invariance under permutations of the states, (iv) its values are in the interval ; they are faithful, that is, their values are equal to one if and only if all the states are equal, and they satisfy orthogonality, that is their values are equal to zero if and only if the states are mutually orthogonal to each other, (v) direct-sum property, (vi) joint concavity, and (vii) uniform continuity bounds under certain conditions. Furthermore, we establish inequalities relating these different variants, indeed clarifying that all these definitions coincide with the average pairwise fidelity for commuting states. We also introduce another multivariate fidelity called multivariate log-Euclidean fidelity, which is a quantum generalization of the Matusita multivariate fidelity. We also show that it satisfies most of the desirable properties listed above, it is a function of a multivariate log-Euclidean divergence, and it has an operational interpretation in terms of quantum hypothesis testing with an arbitrarily varying null hypothesis. Lastly, we propose multivariate generalizations of Matsumoto’s geometric fidelity and establish several properties of them.
more »
« less
- Award ID(s):
- 2329662
- PAR ID:
- 10653940
- Publisher / Repository:
- IOP
- Date Published:
- Journal Name:
- Journal of Physics A: Mathematical and Theoretical
- Volume:
- 58
- Issue:
- 16
- ISSN:
- 1751-8113
- Page Range / eLocation ID:
- 165304
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Minimizing and understanding errors is critical for quantum science, both in noisy intermediate scale quantum (NISQ) devices1and for the quest towards fault-tolerant quantum computation2,3. Rydberg arrays have emerged as a prominent platform in this context4with impressive system sizes5,6and proposals suggesting how error-correction thresholds could be significantly improved by detecting leakage errors with single-atom resolution7,8, a form of erasure error conversion9–12. However, two-qubit entanglement fidelities in Rydberg atom arrays13,14have lagged behind competitors15,16and this type of erasure conversion is yet to be realized for matter-based qubits in general. Here we demonstrate both erasure conversion and high-fidelity Bell state generation using a Rydberg quantum simulator5,6,17,18. When excising data with erasure errors observed via fast imaging of alkaline-earth atoms19–22, we achieve a Bell state fidelity of$$\ge 0.997{1}_{-13}^{+10}$$ , which improves to$$\ge 0.998{5}_{-12}^{+7}$$ when correcting for remaining state-preparation errors. We further apply erasure conversion in a quantum simulation experiment for quasi-adiabatic preparation of long-range order across a quantum phase transition, and reveal the otherwise hidden impact of these errors on the simulation outcome. Our work demonstrates the capability for Rydberg-based entanglement to reach fidelities in the 0.999 regime, with higher fidelities a question of technical improvements, and shows how erasure conversion can be utilized in NISQ devices. These techniques could be translated directly to quantum-error-correction codes with the addition of long-lived qubits7,22–24.more » « less
-
We demonstrate a Bell state analyzer that operates directly on frequency mismatch. Based on electro-optic modulators and Fourier-transform pulse shapers, our quantum frequency processor design implements interleaved Hadamard gates in discrete frequency modes. Experimental tests on entangled-photon inputs reveal fidelities of for discriminating between the and frequency-bin Bell states. Our approach resolves the tension between wavelength-multiplexed state transport and high-fidelity Bell state measurements, which typically require spectral indistinguishability.more » « less
-
Quantum error correction is necessary to perform large-scale quantum computation but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical s between a data qLDPC code and a suitably constructed ancilla code to perform parallel Pauli product measurements (PPMs) on the data logical qubits. For hypergraph product codes, we show that the ancilla can be constructed by simply modifying the base classical codes of the data code, achieving parallel PPMs on a subgrid of the logical qubits with a lower space-time cost than existing schemes for an important class of circuits. Generalizations to 3D and 4D homological product codes further feature fast PPMs in constant depth. While prior work on qLDPC codes has focused on individual logical gates, we initiate the study of fault-tolerant compilation with our expanded set of native qLDPC code operations, constructing algorithmic primitives for preparing -qubit Greenberger-Horne-Zeilinger states and distilling or teleporting magic states with space overhead in and logical cycles, respectively. We further generalize this to key algorithmic subroutines, demonstrating the efficient implementation of quantum adders using parallel operations. Our constructions are naturally compatible with reconfigurable architectures such as neutral atom arrays, paving the way to large-scale quantum computation with low space and time overheads. Published by the American Physical Society2025more » « less
-
Highly excited Rydberg states and their interactions play an important role in quantum computing and simulation. These properties can be predicted accurately for alkali atoms with simple Rydberg level structures. However, an extension of these methods to more complex atoms such as alkaline-earth atoms has not been demonstrated or experimentally validated. Here, we present multichannel quantum defect models for highly excited and Rydberg states with . The models are developed using a combination of existing literature data and new, high-precision laser and microwave spectroscopy in an atomic beam, and validated by detailed comparison with experimentally measured Stark shifts and magnetic moments. We then use these models to compute interaction potentials between two Yb atoms, and find excellent agreement with direct measurements in an optical tweezer array. From the computed interaction potential, we identify an anomalous Förster resonance that likely degraded the fidelity of previous entangling gates in using Rydberg states. We then identify a more suitable state, and achieve a state-of-the-art controlled- gate fidelity of , with the remaining error fully explained by known sources. This work establishes a solid foundation for the continued development of quantum computing, simulation, and entanglement-enhanced metrology with Yb neutral atom arrays. Published by the American Physical Society2025more » « less
An official website of the United States government
