Showing 1–50 of 106 results for author: Jones, C

Precision quantum simulation of magnon spectra and interactions

Authors: Trond I. Andersen, Nikita Astrakhantsev, Jeronimo Martinez, Will Morong, Johannes Motruk, Dario Rossi, Brayden Ware, Bryce Kobrin, Weijie Wu, Elizabeth Bennewitz, Manuel Rudolph, Tom Westerhout, Amira Abbas, Rajeev Acharya, Laleh Aghababaie Beni, Ross Alcaraz, Sayra Alcaraz, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Juan Atalaya, Christopher Ayala, Ryan Babbush, Brian Ballard , et al. (307 additional authors not shown)

Abstract: Quantum simulation promises to advance materials discovery by accurately simulating complex states of matter, their microscopic excitations, and macroscopic response functions. The central challenge in resolving the underlying interacting dynamics is to combine high-fidelity evolution with the sophisticated control necessary to manipulate individual quasi-particles in quantum many-body states. Her… ▽ More Quantum simulation promises to advance materials discovery by accurately simulating complex states of matter, their microscopic excitations, and macroscopic response functions. The central challenge in resolving the underlying interacting dynamics is to combine high-fidelity evolution with the sophisticated control necessary to manipulate individual quasi-particles in quantum many-body states. Here, we report on high-precision simulation of both linear and non-linear response functions in a 2D XY spin-1/2 magnet using an analog-digital superconducting processor of up to 97 qubits. By interleaving digital gates with analog evolution precisely characterized via Hamiltonian learning, we selectively excite magnons at tunable energy densities. Measuring first the linear magnon response -- a central probe in neutron-scattering experiments -- we extract temperature-dependent spectra and lifetimes. Our results reveal stark variations in magnon decay rates across the Brillouin zone, with enhancement near van Hove singularities and suppression for edge-localized modes. Next, we perform a suite of nonlinear measurements, including the study of self-scattering mechanisms, as well as pump-probe spectroscopy to directly characterize the magnon interactions. While matrix-product state simulations capture the dynamics well in either small systems or at low temperatures, their predictions become inaccurate away from these limits. This work demonstrates precise simulation of the interacting dynamics in quantum magnets, and provides key insights into quasi-particles and their microscopic scattering mechanisms. △ Less

Submitted 14 July, 2026; originally announced July 2026.

Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search

Authors: Shraddha Singh, Craig Gidney, Cody Jones

Abstract: Magic-state distillation is one of the leading overheads in fault-tolerant quantum computation. Existing methods for finding distillation factories require a transversal gate to act correctly on the entire codespace, a constraint that limits both generality and search efficiency. We introduce a strictly weaker borrowed-identity condition, requiring only that the distillation circuit act as the ide… ▽ More Magic-state distillation is one of the leading overheads in fault-tolerant quantum computation. Existing methods for finding distillation factories require a transversal gate to act correctly on the entire codespace, a constraint that limits both generality and search efficiency. We introduce a strictly weaker borrowed-identity condition, requiring only that the distillation circuit act as the identity on a single input state. It applies uniformly across all levels of the Clifford hierarchy and unifies, within a single level, factories that distill different magic states -- for example, the $|T\rangle$, $|CS\rangle$, and $|CCZ\rangle$ factories. A brute-force search over borrowed-identity circuits with two-group symmetry recovers, within the search range, all distance-2 factories known from code-construction approaches, including entangled-output and multi-output factories previously outside the scope of any single numerical search. This unification yields parent circuits that encode multiple factories, so the output magic-state type can be chosen at compile time rather than fixed by a hard-coded design. The framework also extends beyond CSS codes, unifying constructions, including synthillation and non-CSS catalytic factories, previously obtained by disparate approaches. △ Less

Submitted 13 July, 2026; v1 submitted 26 June, 2026; originally announced June 2026.

Comments: 5+11 pages, 6 figures, 5 tables

Multi-Qubit Entanglement of Unit Cell Pairs in SiMOS

Authors: Cameron Jones, Jonathan Y. Huang, Santiago Serrano, MengKe Feng, Gerardo A. Paz-Silva, Tuomo Tanttu, Paul Steinacker, Fay E. Hudson, Wee Han Lim, Nikolay V. Abrosimov, Hans-Joachim Pohl, Michael L. W. Thewalt, Andrew S. Dzurak, Andre Saraiva, Arne Laucht, Chih Hwan Yang

Abstract: Spin qubits in silicon-MOS (SiMOS) quantum dots have recently demonstrated compatibility with existing industry standard CMOS fabrication techniques. These devices have routinely achieved single- and two-qubit gate fidelities above 99% and demonstrated highly entangled two-qubit Bell states in isolated double quantum dot (DQD) unit cells, however coupling between unit cells has remained challengin… ▽ More Spin qubits in silicon-MOS (SiMOS) quantum dots have recently demonstrated compatibility with existing industry standard CMOS fabrication techniques. These devices have routinely achieved single- and two-qubit gate fidelities above 99% and demonstrated highly entangled two-qubit Bell states in isolated double quantum dot (DQD) unit cells, however coupling between unit cells has remained challenging. In this work, we present a two unit cell, four-qubit SiMOS processor with universal controllability and fully parallelised state initialisation and readout. We use this processor to generate maximally entangled three-qubit states, including the Greenberger-Horne-Zeilinger (GHZ) state, and certify multipartite entanglement through violation of the classical Mermin-witness bound. By using a fully symmetric dynamically decoupled gate sequence to create our entangled states, we are able to preserve the lifetime of the entanglement beyond $T_2^*$, to a time limited instead by $T_2^\textrm{Hahn}$. These demonstrations pave a road to the scalable operation of larger SiMOS processors, and achieving high purity, long-lived multi-qubit entangled states in them. △ Less

Submitted 20 May, 2026; originally announced May 2026.

Comments: 20 pages, 12 figures

Resource-Efficient Quantum-Enhanced Compressive Imaging via Quantum Classical co-Design

Authors: Haowei Shi, Visuttha Manthamkarn, Christopher M. Jones, Zheshen Zhang, Quntao Zhuang

Abstract: Quantum sensing can enhance imaging performance by reducing measurement noise below the classical limit, thereby improving the signal-to-noise ratio (SNR) of acquired data. In conventional quantum imaging schemes, squeezing is applied independently to each pixel or spatial mode, leading to a quantum resource cost that scales linearly with image dimension. This approach implicitly separates quantum… ▽ More Quantum sensing can enhance imaging performance by reducing measurement noise below the classical limit, thereby improving the signal-to-noise ratio (SNR) of acquired data. In conventional quantum imaging schemes, squeezing is applied independently to each pixel or spatial mode, leading to a quantum resource cost that scales linearly with image dimension. This approach implicitly separates quantum enhancement from classical post-processing, treating them as independent layers. In this work, we demonstrate that integrating quantum resource allocation with the guidance from classical compressive imaging, via co-design between the quantum hardware layer and the classical software layer, substantially reduces the required quantum resources. We employ principal component analysis (PCA) to identify a low-dimensional principal component subspace for measurement and apply squeezing selectively to the most informative spatial modes corresponding to these principal components. Our numerical experiments show that high-accuracy image classification and high-fidelity image reconstruction can be achieved with significantly fewer squeezed modes compared to pixel-wise squeezing. Our results establish a joint quantum classical co-design framework for resource-efficient quantum-enhanced imaging. △ Less

Submitted 17 April, 2026; originally announced April 2026.

The Grothendieck Constant is Strictly Larger than Davie-Reeds' Bound

Authors: Chris Jones, Giulio Malavolta

Abstract: The Grothendieck constant $K_{G}$ is a fundamental quantity in functional analysis, with important connections to quantum information, combinatorial optimization, and the geometry of Banach spaces. Despite decades of study, the value of $K_{G}$ is unknown. The best known lower bound on $K_{G}$ was obtained independently by Davie and Reeds in the 1980s. In this paper we show that their bound is not… ▽ More The Grothendieck constant $K_{G}$ is a fundamental quantity in functional analysis, with important connections to quantum information, combinatorial optimization, and the geometry of Banach spaces. Despite decades of study, the value of $K_{G}$ is unknown. The best known lower bound on $K_{G}$ was obtained independently by Davie and Reeds in the 1980s. In this paper we show that their bound is not optimal. We prove that $K_{G} \ge K_{DR} + 10^{-12}$, where $K_{DR}$ denotes the Davie-Reeds lower bound. Our argument is based on a perturbative analysis of the Davie-Reeds operator. We show that every near-extremizer for the Davie-Reeds problem has $Ω(1)$ weight on its degree-3 Hermite coefficients, and therefore introducing a small cubic perturbation increases the integrality gap of the operator. △ Less

Submitted 31 March, 2026; originally announced March 2026.

Comments: 14 pages

Quantum Computing -- Strategic Recommendations for the Industry

Authors: Marvin Erdmann, Lukas Karch, Abhishek Awasthi, Caitlin Isobel Jones, Pallavi Bhardwaj, Florian Krellner, Jonas Stein, Claudia Linnhoff-Popien, Nico Kraus, Peter Eder, Sarah Braun, Tong Liu

Abstract: This whitepaper surveys the current landscape and short- to mid-term prospects for quantum-enabled optimization and machine learning use cases in industrial settings. Grounded in the QCHALLenge program, it synthesizes hardware trajectories from different quantum architectures and providers, and assesses their maturity and potential for real-world use cases under a standardized traffic-light evalua… ▽ More This whitepaper surveys the current landscape and short- to mid-term prospects for quantum-enabled optimization and machine learning use cases in industrial settings. Grounded in the QCHALLenge program, it synthesizes hardware trajectories from different quantum architectures and providers, and assesses their maturity and potential for real-world use cases under a standardized traffic-light evaluation framework. We provide a concise summary of relevant hardware roadmaps, distinguishing superconducting and ion-trap technologies, their current states, modalities, and projected scaling trajectories. The core of the presented work are the use case evaluations in the domains of optimization problems and machine learning applications. For the conducted experiments, we apply a consistent set of evaluation criteria (model formulation, scalability, solution quality, runtime, and transferability) which are assessed in a shared system of three categories, ranging from optimistic (solutions produced by quantum computers are competitive with classical methods and/or a clear path to a quantum advantage is shown) to pessimistic (significant hurdles prevent practical application of quantum solutions now and potentially in the future). The resulting verdicts illuminate where quantum approaches currently offer promise, where hybrid classical-quantum strategies are most viable, and where classical methods are expected to remain superior. △ Less

Submitted 13 January, 2026; originally announced January 2026.

Hilbert space signatures of non-ergodic glassy dynamics

Authors: Aleksey Lunkin, Nicole S. Ticea, Shashwat Kumar, Connie Miao, Jaehong Choi, Mohammed Alghadeer, Ilya Drozdov, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Laleh Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Brian Ballard, Joseph C. Bardin, Hector Bates, Andreas Bengtsson , et al. (270 additional authors not shown)

Abstract: Disorder in quantum many-body systems can drive transitions between ergodic and non-ergodic phases, yet the nature--and even the existence--of these transitions remains intensely debated. Using a two-dimensional array of superconducting qubits, we study an interacting spin model at finite temperature in a disordered landscape, tracking dynamics both in real space and in Hilbert space. Over a broad… ▽ More Disorder in quantum many-body systems can drive transitions between ergodic and non-ergodic phases, yet the nature--and even the existence--of these transitions remains intensely debated. Using a two-dimensional array of superconducting qubits, we study an interacting spin model at finite temperature in a disordered landscape, tracking dynamics both in real space and in Hilbert space. Over a broad disorder range, we observe an intermediate non-ergodic regime with glass-like characteristics: physical observables become broadly distributed and some, but not all, degrees of freedom are effectively frozen. The Hilbert-space return probability shows slow power-law decay, consistent with finite-temperature quantum glassiness. In the same regime, we detect the onset of a finite Edwards-Anderson order parameter and the disappearance of spin diffusion. By contrast, at lower disorder, spin transport persists with a nonzero diffusion coefficient. Our results show that there is a transition out of the ergodic phase in two-dimensional systems. △ Less

Submitted 15 April, 2026; v1 submitted 3 January, 2026; originally announced January 2026.

Observation of disorder-induced superfluidity

Authors: Nicole Ticea, Elias Portoles, Eliott Rosenberg, Alexander Schuckert, Aaron Szasz, Bryce Kobrin, Nicolas Pomata, Pranjal Praneel, Connie Miao, Shashwat Kumar, Ella Crane, Ilya Drozdov, Yuri Lensky, Sofia Gonzalez-Garcia, Thomas Kiely, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Markus Ansmann, Frank Arute, Kunal Arya , et al. (277 additional authors not shown)

Abstract: The emergence of states with long-range correlations in a disordered landscape is rare, as disorder typically suppresses the particle mobility required for long-range coherence. But when more than two energy levels are available per site, disorder can induce resonances that locally enhance mobility. Here we explore phases arising from the interplay between disorder, kinetic energy, and interaction… ▽ More The emergence of states with long-range correlations in a disordered landscape is rare, as disorder typically suppresses the particle mobility required for long-range coherence. But when more than two energy levels are available per site, disorder can induce resonances that locally enhance mobility. Here we explore phases arising from the interplay between disorder, kinetic energy, and interactions on a superconducting processor with qutrit readout and control. Compressibility measurements distinguish an incompressible Mott insulator from surrounding compressible phases and reveal signatures of glassiness, reflected in non-ergodic behavior. Spatially-resolved two-point correlator measurements identify regions of the phase diagram with a non-vanishing condensate fraction. We also visualize the spectrum by measuring the dynamical structure factor. A linearly-dispersing phonon mode materializes in the superfluid, appearing even when disorder is introduced to the clean Mott insulator. Our results provide strong experimental evidence for disorder-induced superfluidity. △ Less

Submitted 3 February, 2026; v1 submitted 24 December, 2025; originally announced December 2025.

Comments: Supplement updated

Magic state cultivation on a superconducting quantum processor

Authors: Emma Rosenfeld, Craig Gidney, Gabrielle Roberts, Alexis Morvan, Nathan Lacroix, Dvir Kafri, Jeffrey Marshall, Ming Li, Volodymyr Sivak, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Brian Ballard , et al. (270 additional authors not shown)

Abstract: Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments… ▽ More Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments. We present an experimental study of magic state cultivation on a superconducting quantum processor. We implement cultivation, including code-switching into a surface code, and develop a fault-tolerant measurement protocol to bound the magic state fidelity. Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1) (retaining 8% of attempts). Our results experimentally establish magic state cultivation as a viable solution to one of quantum computing's most significant challenges. △ Less

Submitted 15 December, 2025; originally announced December 2025.

Mid-circuit logic executed in the qubit layer of a quantum processor

Authors: Cameron Jones, Piper Wysocki, MengKe Feng, Gerardo A. Paz-Silva, Corey I. Ostrove, Tuomo Tanttu, Kenneth M. Rudinger, Samuel K. Bartee, Kevin Young, Fay E. Hudson, Wee Han Lim, Nikolay V. Abrosimov, Hans-Joachim Pohl, Michael L. W. Thewalt, Robin Blume-Kohout, Andrew S. Dzurak, Andre Saraiva, Arne Laucht, Chih Hwan Yang

Abstract: Practical quantum computers need to continuously exchange data between classical and quantum subsystems during a computation. Mid-circuit measurements of a qubits state are transferred to the classical electronics layer, and their outcome can inform feedforward operations that close the loop back to the quantum layer. These operations are crucial for fault-tolerant quantum computers, but the quant… ▽ More Practical quantum computers need to continuously exchange data between classical and quantum subsystems during a computation. Mid-circuit measurements of a qubits state are transferred to the classical electronics layer, and their outcome can inform feedforward operations that close the loop back to the quantum layer. These operations are crucial for fault-tolerant quantum computers, but the quantum-classical loop must be completed before the qubits decohere, presenting a substantial engineering challenge for full-scale systems comprising millions of qubits. Here we perform the first mid-circuit measurements in a system of silicon spin qubits, and show that feedforward operations can be performed without needing to route information to the classical layer. This in-layer approach leverages a backaction-driven control technique that has previously been considered a source of error. We benchmark our in-layer strategy, together with the standard FPGA-enabled approach, and analyse the performance of both methods using gate set tomography. Our results provide the first step towards moving resource-intensive classical processing into the quantum layer, an advance that could solve key engineering challenges, and drastically reduce the power budget of future quantum computers. △ Less

Submitted 3 March, 2026; v1 submitted 14 December, 2025; originally announced December 2025.

Comments: 21 pages, 11 figures

A scalable and real-time neural decoder for topological quantum codes

Authors: Andrew W. Senior, Thomas Edlich, Francisco J. H. Heras, Lei M. Zhang, Oscar Higgott, James S. Spencer, Taylor Applebaum, Sam Blackwell, Justin Ledford, Akvilė Žemgulytė, Augustin Žídek, Noah Shutty, Andrew Cowie, Yin Li, George Holland, Peter Brooks, Charlie Beattie, Michael Newman, Alex Davies, Cody Jones, Sergio Boixo, Hartmut Neven, Pushmeet Kohli, Johannes Bausch

Abstract: Fault-tolerant quantum computing will require error rates far below those achievable with physical qubits. Quantum error correction (QEC) bridges this gap, but depends on decoders being simultaneously fast, accurate, and scalable. This combination of requirements remains unmet by a machine-learning decoder, nor by any decoder for promising resource-efficient codes such as the color code. Here we i… ▽ More Fault-tolerant quantum computing will require error rates far below those achievable with physical qubits. Quantum error correction (QEC) bridges this gap, but depends on decoders being simultaneously fast, accurate, and scalable. This combination of requirements remains unmet by a machine-learning decoder, nor by any decoder for promising resource-efficient codes such as the color code. Here we introduce AlphaQubit 2, a neural-network decoder that achieves near-optimal logical error rates for both surface and color codes at scale under realistic noise. For the color code, it is orders of magnitude faster than other high-accuracy decoders. We demonstrate real-time decoding faster than 1μs per cycle on commercial accelerators: for the surface code to distance 11, with better accuracy than leading real-time decoders; and the first real-time decoding of the color code to distance 9. These results support the practical application of a wider class of promising QEC codes, and establish a credible path towards high-accuracy, real-time neural decoding at the scales required for fault-tolerant quantum computation. △ Less

Submitted 11 March, 2026; v1 submitted 8 December, 2025; originally announced December 2025.

Comments: with color code realtime decoding results

MSC Class: 81P73; 68T07 ACM Class: I.2.0; J.2

Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality

Authors: Shashwat Kumar, Eliott Rosenberg, Alejandro Grajales Dau, Rodrigo Cortinas, Dmitri Maslov, Richard Oliver, Adam Zalcman, Matthew Neeley, Alice Pagano, Aaron Szasz, Ilya Drozdov, Zlatko Minev, Craig Gidney, Noureldin Yosri, Stijn J. de Graaf, Aniket Maiti, Dmitry Abanin, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute , et al. (258 additional authors not shown)

Abstract: The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probab… ▽ More The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits. With a few qubits, we illustrate quantum contextuality with the magic square game, as well as quantify it through a Kochen--Specker--Bell inequality violation. To examine many-body contextuality, we implement the N-player GHZ game and separately solve a 2D hidden linear function problem, exceeding classical success rate in both. Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms. △ Less

Submitted 1 December, 2025; originally announced December 2025.

Reinforcement Learning Control of Quantum Error Correction

Authors: Volodymyr Sivak, Alexis Morvan, Michael Broughton, Rodrigo G. Cortiñas, Johannes Bausch, Andrew W. Senior, Matthew Neeley, Alec Eickbusch, Noah Shutty, Laleh Aghababaie Beni, James S. Spencer, Francisco J. H Heras, Thomas Edlich, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Nikita Astrakhantsev , et al. (274 additional authors not shown)

Abstract: Quantum error correction (QEC) is the primary strategy for protecting a quantum computer from the environment. Its prerequisite is that errors must remain sufficiently rare, which requires perpetually adapting the computer's control parameters to the drifting environment conditions. The current solution to this problem is to terminate the entire quantum computation for recalibration, but it is inc… ▽ More Quantum error correction (QEC) is the primary strategy for protecting a quantum computer from the environment. Its prerequisite is that errors must remain sufficiently rare, which requires perpetually adapting the computer's control parameters to the drifting environment conditions. The current solution to this problem is to terminate the entire quantum computation for recalibration, but it is incompatible with the long runtimes of future quantum algorithms. We address this challenge by unifying calibration with computation. We grant the QEC process a dual role: its error detection events are not only used to correct the logical quantum state, but are also repurposed as a learning signal, teaching a reinforcement learning (RL) agent to continuously steer the control parameters and stabilize the quantum system during computation. We experimentally demonstrate this framework on a Willow superconducting processor, improving the logical stability of the surface code 3.5-fold against injected drift. By synthesizing our full suite of technological advances, we achieve record performance of the surface and color codes, with average logical error per cycle of $7.72(9)\times10^{-4}$ and $8.19(14)\times10^{-3}$ respectively. Numerical simulations of large codes with tens of thousands of control parameters confirm the scalability of our RL framework, revealing an optimization speed that is independent of system size. This work thus enables a new paradigm: a quantum computer that learns from its errors and never stops computing. △ Less

Submitted 19 June, 2026; v1 submitted 11 November, 2025; originally announced November 2025.

Quantum computation of molecular geometry via many-body nuclear spin echoes

Authors: C. Zhang, R. G. Cortiñas, A. H. Karamlou, N. Noll, J. Provazza, J. Bausch, S. Shirobokov, A. White, M. Claassen, S. H. Kang, A. W. Senior, N. Tomašev, J. Gross, K. Lee, T. Schuster, W. J. Huggins, H. Celik, A. Greene, B. Kozlovskii, F. J. H. Heras, A. Bengtsson, A. Grajales Dau, I. Drozdov, B. Ying, W. Livingstone , et al. (298 additional authors not shown)

Abstract: Quantum-information-inspired experiments in nuclear magnetic resonance spectroscopy may yield a pathway towards determining molecular structure and properties that are otherwise challenging to learn. We measure out-of-time-ordered correlators (OTOCs) [1-4] on two organic molecules suspended in a nematic liquid crystal, and investigate the utility of this data in performing structural learning task… ▽ More Quantum-information-inspired experiments in nuclear magnetic resonance spectroscopy may yield a pathway towards determining molecular structure and properties that are otherwise challenging to learn. We measure out-of-time-ordered correlators (OTOCs) [1-4] on two organic molecules suspended in a nematic liquid crystal, and investigate the utility of this data in performing structural learning tasks. We use OTOC measurements to augment molecular dynamics models, and to correct for known approximations in the underlying force fields. We demonstrate the utility of OTOCs in these models by estimating the mean ortho-meta H-H distance of toluene and the mean dihedral angle of 3',5'-dimethylbiphenyl, achieving similar accuracy and precision to independent spectroscopic measurements of both quantities. To ameliorate the apparent exponential classical cost of interpreting the above OTOC data, we simulate the molecular OTOCs on a Willow superconducting quantum processor, using AlphaEvolve-optimized [5] quantum circuits and arbitrary-angle fermionic simulation gates. We implement novel zero-noise extrapolation techniques based on the Pauli pathing model of operator dynamics [6], to repeat the learning experiments with root-mean-square error $0.05$ over all circuits used. Our work highlights a computational protocol to interpret many-body echoes from nuclear magnetic systems using low resource quantum computation. △ Less

Submitted 22 October, 2025; originally announced October 2025.

Distinct Lifetimes for $X$ and $Z$ Loop Measurements in a Majorana Tetron Device

Authors: Morteza Aghaee, Zulfi Alam, Rikke Andersen, Mariusz Andrzejczuk, Andrey Antipov, Mikhail Astafev, Lukas Avilovas, Ahmad Azizimanesh, Eric Banek, Bela Bauer, Jonathan Becker, Umesh Kumar Bhaskar, Andrea G. Boa, Srini Boddapati, Nichlaus Bohac, Jouri D. S. Bommer, Jan Borovsky, Léo Bourdet, Samuel Boutin, Lucas Casparis, Srivatsa Chakravarthi, Hamidreza Chalabi, Benjamin J. Chapman, Nikolaos Chatzaras, Tzu-Chiao Chien , et al. (142 additional authors not shown)

Abstract: We present a hardware realization and measurements of a tetron qubit device in a superconductor-semiconductor heterostructure. The device architecture contains two parallel superconducting nanowires, which support four Majorana zero modes (MZMs) when tuned into the topological phase, and a trivial superconducting backbone. Two distinct readout interferometers are formed by connecting the supercond… ▽ More We present a hardware realization and measurements of a tetron qubit device in a superconductor-semiconductor heterostructure. The device architecture contains two parallel superconducting nanowires, which support four Majorana zero modes (MZMs) when tuned into the topological phase, and a trivial superconducting backbone. Two distinct readout interferometers are formed by connecting the superconducting structure to a series of quantum dots. We perform single-shot interferometric measurements of the fermion parity for the two loops, designed to implement Pauli-$X$ and $Z$ measurements of the tetron. Performing repeated single-shot measurements yields two widely separated time scales $τ_X = 14.5\pm 0.3 \, \mathrm{μs}$ and $τ_Z = 12.4\pm 0.4\, \mathrm{ms}$ for parity switches observed in the $X$ and $Z$ measurement loops, which we attribute to intra-wire parity switches and external quasiparticle poisoning, respectively. We estimate assignment errors of $\mathrm{err}^X_a=16\%$ and $\mathrm{err}^Z_a=0.5\%$ for $X$ and $Z$ measurement-based operations, respectively. △ Less

Submitted 4 September, 2025; v1 submitted 11 July, 2025; originally announced July 2025.

Comments: Extended discussion of switching dynamics and multiple time scales in App. A. Added App. C on alternative scenarios. Corrected Figs. 2(i) & A4. Explained the method for extracting multiple time scales from long time traces in App. A

Holography for bulk-boundary local topological order

Authors: Corey Jones, Pieter Naaijkens, David Penneys

Abstract: In our previous article [arXiv:2307.12552], we introduced local topological order (LTO) axioms for quantum spin systems which allowed us to define a physical boundary (associated to a cut of the lattice) manifested by a net of boundary algebras in one dimension lower. This gives a formal setting for topological holography, where the braided tensor category of DHR bimodules of the physical boundary… ▽ More In our previous article [arXiv:2307.12552], we introduced local topological order (LTO) axioms for quantum spin systems which allowed us to define a physical boundary (associated to a cut of the lattice) manifested by a net of boundary algebras in one dimension lower. This gives a formal setting for topological holography, where the braided tensor category of DHR bimodules of the physical boundary algebra captures the bulk topological order. In this article, we extend the LTO axioms to quantum spin systems equipped with a topological boundary (domain wall with the trivial phase), again producing a physical boundary algebra for the bulk-boundary system, whose category of (topological) boundary DHR bimodules recovers the topological boundary order. We perform this analysis in explicit detail for Levin-Wen and Walker-Wang bulk-boundary systems. Along the way, we introduce a 2D braided categorical net of algebras built from a unitary braided fusion category (UBFC). Such nets arise as boundary algebras of Walker-Wang models. We consider the canonical state on this braided categorical net corresponding to the standard topological boundary for the Walker-Wang model. Interestingly, in this state, the cone von Neumann algebras are type I with finite dimensional centers, in contrast with the type II and III cone von Neumann algebras from the Levin-Wen models studied in [arXiv:2307.12552]. Their superselection sectors recover the underlying unitary category of our UBFC, and we conjecture the superselection category also captures the fusion and braiding. △ Less

Submitted 17 June, 2026; v1 submitted 24 June, 2025; originally announced June 2025.

Comments: 47 pages, many figures. Comments welcome! v2: updated introduction and added toric code example

MSC Class: 81T05; 81T25 (primary); 18M20; 46L37; 46L60; 81V27 (secondary)

Certified randomness from quantum speed limits

Authors: Caroline L. Jones, Albert Aloy, Gerard Higgins, Markus P. Mueller

Abstract: Quantum speed limits are usually regarded as fundamental restrictions, constraining the amount of computation that can be achieved within some given time and energy. Complementary to this intuition, here we show that these limitations are also of operational value: they enable the secure generation of certified randomness. We consider a prepare-and-measure scenario with some (experimentally determ… ▽ More Quantum speed limits are usually regarded as fundamental restrictions, constraining the amount of computation that can be achieved within some given time and energy. Complementary to this intuition, here we show that these limitations are also of operational value: they enable the secure generation of certified randomness. We consider a prepare-and-measure scenario with some (experimentally determined or promised) upper bound on the energy uncertainty of the average prepared quantum state, but without any further assumptions on the devices, Hilbert space or Hamiltonian. Given that we can freely choose the time at which to apply the untrusted preparation procedure, we show that this scenario admits the generation of randomness that is secure against adversaries with additional classical information. We show how to determine the amount of certified randomness given the observed correlations, discuss how interactions with the environment are taken into account, and sketch a conceivable experimental implementation. In particular, we show that single-mode coherent states admit this kind of certification of non-zero randomness in some parameter regimes, reinforcing existing demonstrations of nonclassicality in the simple harmonic oscillator. Our results extend earlier efforts to devise semi-device-independent protocols grounded in reasonable physical assumptions, and they contribute to the understanding of time-energy uncertainty relations via their operational consequences. △ Less

Submitted 11 March, 2026; v1 submitted 17 June, 2025; originally announced June 2025.

Comments: 11+10 pages, 8 figures. V3: close to published version

Journal ref: PRX Quantum 7, 010349 (2026)

Constructive interference at the edge of quantum ergodic dynamics

Authors: Dmitry A. Abanin, Rajeev Acharya, Laleh Aghababaie-Beni, Georg Aigeldinger, Ashok Ajoy, Ross Alcaraz, Igor Aleiner, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Dave Bacon, Brian Ballard, Joseph C. Bardin, Christian Bengs, Andreas Bengtsson, Alexander Bilmes, Sergio Boixo, Gina Bortoli, Alexandre Bourassa, Jenna Bovaird , et al. (240 additional authors not shown)

Abstract: Quantum observables in the form of few-point correlators are the key to characterizing the dynamics of quantum many-body systems. In dynamics with fast entanglement generation, quantum observables generally become insensitive to the details of the underlying dynamics at long times due to the effects of scrambling. In experimental systems, repeated time-reversal protocols have been successfully imp… ▽ More Quantum observables in the form of few-point correlators are the key to characterizing the dynamics of quantum many-body systems. In dynamics with fast entanglement generation, quantum observables generally become insensitive to the details of the underlying dynamics at long times due to the effects of scrambling. In experimental systems, repeated time-reversal protocols have been successfully implemented to restore sensitivities of quantum observables. Using a 103-qubit superconducting quantum processor, we characterize ergodic dynamics using the second-order out-of-time-order correlators, OTOC$^{(2)}$. In contrast to dynamics without time reversal, OTOC$^{(2)}$ are observed to remain sensitive to the underlying dynamics at long time scales. Furthermore, by inserting Pauli operators during quantum evolution and randomizing the phases of Pauli strings in the Heisenberg picture, we observe substantial changes in OTOC$^{(2)}$ values. This indicates that OTOC$^{(2)}$ is dominated by constructive interference between Pauli strings that form large loops in configuration space. The observed interference mechanism endows OTOC$^{(2)}$ with a high degree of classical simulation complexity, which culminates in a set of large-scale OTOC$^{(2)}$ measurements exceeding the simulation capacity of known classical algorithms. Further supported by an example of Hamiltonian learning through OTOC$^{(2)}$, our results indicate a viable path to practical quantum advantage. △ Less

Submitted 11 June, 2025; originally announced June 2025.

Comments: See following link: https://zenodo.org/records/15640503, which includes: Circuits used in Fig. 3d, Fig. 3e, Fig. 4a, Fig. 4b of the main text. In addition, OTOC (C^(2)) circuits and data with 95, 40 and 31 qubits are also provided. For system sizes <= 40 qubits, we include exact simulation results. For system sizes > 40, we include experimental data

TabularQGAN: A quantum generative model for tabular data synthesis

Authors: Pallavi Bhardwaj, Caitlin Jones, Lasse Dierich, Aleksandar Vučković

Abstract: In this paper, we introduce a novel quantum generative model for synthesizing tabular data. Synthetic data is valuable in scenarios where real-world data is scarce or private, as it can be used to augment or replace existing datasets. As enterprise data is predominantly tabular and heterogeneous, often consisting of both categorical and numerical features, this task is relevant across various indu… ▽ More In this paper, we introduce a novel quantum generative model for synthesizing tabular data. Synthetic data is valuable in scenarios where real-world data is scarce or private, as it can be used to augment or replace existing datasets. As enterprise data is predominantly tabular and heterogeneous, often consisting of both categorical and numerical features, this task is relevant across various industries such as healthcare, finance, and software. Existing quantum generative models are designed for homogeneous data; we seek to fill this gap by proposing a quantum generative adversarial network architecture with flexible data encoding and a novel quantum circuit ansatz for effectively modeling tabular data. The proposed approach is tested on the MIMIC-III healthcare and Adult Census datasets, with extensive benchmarking against leading classical models, CTGAN, CopulaGAN, VAE-GMM, and an LLM-based approach using the be-GReaT framework for tabular data synthesis. We evaluated our model as a proof-of-concept on reduced feature subsets using a noiseless statevector simulator on classical hardware. Our simulations show that, for the MIMIC-III dataset, our quantum model achieves competitive, and in some cases, leading performance with respect to an overall similarity score used in the open-source Python library SDMetrics. Additionally, we evaluate the generalization capabilities of the models using two custom-designed metrics that demonstrate the ability of the proposed quantum model to generate useful and novel tabular samples. △ Less

Submitted 18 August, 2026; v1 submitted 28 May, 2025; originally announced May 2025.

Comments: 19 pages,8 figures and 4 tables

Journal ref: Sci. Rep. 16, 23555 (2026)1-19

Engineering diamond interfaces free of dark spins

Authors: Xiaofei Yu, Evan J. Villafranca, Stella Wang, Jessica C. Jones, Mouzhe Xie, Jonah Nagura, Ignacio Chi-Durán, Nazar Delegan, Alex B. F. Martinson, Michael E. Flatté, Denis R. Candido, Giulia Galli, Peter C. Maurer

Abstract: Nitrogen-vacancy (NV) centers in diamond are extensively utilized as quantum sensors for imaging fields at the nanoscale. The ultra-high sensitivity of NV magnetometers has enabled the detection and spectroscopy of individual electron spins, with potentially far-reaching applications in condensed matter physics, spintronics, and molecular biology. However, the surfaces of these diamond sensors nat… ▽ More Nitrogen-vacancy (NV) centers in diamond are extensively utilized as quantum sensors for imaging fields at the nanoscale. The ultra-high sensitivity of NV magnetometers has enabled the detection and spectroscopy of individual electron spins, with potentially far-reaching applications in condensed matter physics, spintronics, and molecular biology. However, the surfaces of these diamond sensors naturally contain electron spins, which create a background signal that can be hard to differentiate from the signal of the target spins. In this study, we develop a surface modification approach that eliminates the unwanted signal of these so-called dark electron spins. Our surface passivation technique, based on coating diamond surfaces with a thin titanium oxide (TiO$_2$) layer, reduces the dark spin density. The observed reduction in dark spin density aligns with our findings on the electronic structure of the diamond-TiO$_2$ interface. The reduction, from a typical value of $2,000$~$μ$m$^{-2}$ to a value below that set by the detection limit of our NV sensors ($200$~$μ$m$^{-2}$), results in a two-fold increase in Hahn-echo coherence time of near surface NV centers. Furthermore, we derive a comprehensive spin model that connects dark spin relaxation with NV coherence, providing additional insights into the mechanisms behind the observed spin dynamics. Our findings are directly transferable to other quantum platforms, including nanoscale solid state qubits and superconducting qubits. △ Less

Submitted 19 December, 2025; v1 submitted 11 April, 2025; originally announced April 2025.

Comments: Main text: 7 pages, 5 figures

Journal ref: Phys. Rev. Applied 25, 034006 (2026)

Quantum-enhanced radio-frequency photonic distributed imaging

Authors: Haowei Shi, Christopher M. Jones, Mengjie Yu, Zheshen Zhang, Quntao Zhuang

Abstract: Quantum physics has brought enhanced capability in various sensing applications. Despite challenges from noise and loss in the radio-frequency (RF) domain, [Phys. Rev. Lett. 124, 150502 (2020)] demonstrates a route for enhanced RF-receiver empowered by quantum squeezing and entanglement. In this work, we further explore the quantum advantage of imaging in the weak coupling scenario of the RF-photo… ▽ More Quantum physics has brought enhanced capability in various sensing applications. Despite challenges from noise and loss in the radio-frequency (RF) domain, [Phys. Rev. Lett. 124, 150502 (2020)] demonstrates a route for enhanced RF-receiver empowered by quantum squeezing and entanglement. In this work, we further explore the quantum advantage of imaging in the weak coupling scenario of the RF-photonic receiver. The proposed imaging receiver applies transducer to upconvert the RF signal to optical to enable high-efficiency connection via low-loss fiber networks. The efficient connection therefore increases the synthetic aperture and improves the resolution of the distributed imaging system. To overcome the challenge from low transduction efficiency in existing devices limited by weak photon interaction, we propose the use of squeezed-state optical sources to suppress the noise. We numerically evaluate the quantum advantage in synthetic aperture radar imaging, where the images are generated from the standard resolution test chart via a Gaussian point spread function with added Gaussian noise. We apply the Wiener filter on the images to restore the objects and find that stronger squeezing significantly improves the quality of the restored image. Our findings push quantum squeezing advantage to real-world applications. △ Less

Submitted 4 March, 2025; originally announced March 2025.

Comments: 8 pages, 6 figures

Generative-enhanced optimization for knapsack problems: an industry-relevant study

Authors: Yelyzaveta Vodovozova, Abhishek Awasthi, Caitlin Jones, Joseph Doetsch, Karen Wintersperger, Florian Krellner, Carlos A. Riofrío

Abstract: Optimization is a crucial task in various industries such as logistics, aviation, manufacturing, chemical, pharmaceutical, and insurance, where finding the best solution to a problem can result in significant cost savings and increased efficiency. Tensor networks (TNs) have gained prominence in recent years in modeling classical systems with quantum-inspired approaches. More recently, TN generativ… ▽ More Optimization is a crucial task in various industries such as logistics, aviation, manufacturing, chemical, pharmaceutical, and insurance, where finding the best solution to a problem can result in significant cost savings and increased efficiency. Tensor networks (TNs) have gained prominence in recent years in modeling classical systems with quantum-inspired approaches. More recently, TN generative-enhanced optimization (TN-GEO) has been proposed as a strategy which uses generative modeling to efficiently sample valid solutions with respect to certain constraints of optimization problems. Moreover, it has been shown that symmetric TNs (STNs) can encode certain constraints of optimization problems, thus aiding in their solution process. In this work, we investigate the applicability of TN- and STN-GEO to an industry relevant problem class, a multi-knapsack problem, in which each object must be assigned to an available knapsack. We detail a prescription for practitioners to use the TN-and STN-GEO methodology and study its scaling behavior and dependence on its hyper-parameters. We benchmark 60 different problem instances and find that TN-GEO and STN-GEO produce results of similar quality to simulated annealing. △ Less

Submitted 7 February, 2025; originally announced February 2025.

Coulomb sensing of single ballistic electrons

Authors: J. D. Fletcher, W. Park, P. See, J. P. Griffiths, G. A. C. Jones, I. Farrer, D. A. Ritchie, H. -S. Sim, M. Kataoka

Abstract: While ballistic electrons are a key tool for applications in sensing and flying qubits, sub-nanosecond propagation times and complicated interactions make control of ballistic single electrons challenging. Recent experiments have revealed Coulomb collisions of counterpropagating electrons in a beam splitter, giving time resolved control of interactions between single electrons. Here we use remote… ▽ More While ballistic electrons are a key tool for applications in sensing and flying qubits, sub-nanosecond propagation times and complicated interactions make control of ballistic single electrons challenging. Recent experiments have revealed Coulomb collisions of counterpropagating electrons in a beam splitter, giving time resolved control of interactions between single electrons. Here we use remote Coulomb interactions to demonstrate a scheme for sensing single ballistic electrons. We show that interactions are highly controllable via electron energy and emission timing. We use a weakly-coupled `sensing' regime to characterise the nanoscale potential landscape of the beam splitter and the strength of the Coulomb interaction, and show multi-electron sensing with picosecond resolution. △ Less

Submitted 20 December, 2024; originally announced December 2024.

Comments: 6 pages, 5 figures (main) + 11 pages, 10 figures (supplementary)

Demonstrating dynamic surface codes

Authors: Alec Eickbusch, Matt McEwen, Volodymyr Sivak, Alexandre Bourassa, Juan Atalaya, Jahan Claes, Dvir Kafri, Craig Gidney, Christopher W. Warren, Jonathan Gross, Alex Opremcak, Nicholas Zobrist, Kevin C. Miao, Gabrielle Roberts, Kevin J. Satzinger, Andreas Bengtsson, Matthew Neeley, William P. Livingston, Alex Greene, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Trond I. Andersen, Markus Ansmann , et al. (182 additional authors not shown)

Abstract: A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new co… ▽ More A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new code implementations. In this work, we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a unique solution to hardware design challenges and introducing flexibility in surface code realization. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of $Λ_{35,\text{hex}} = 2.15(2)$, $Λ_{35,\text{walk}} = 1.69(6)$, and $Λ_{35,\text{iSWAP}} = 1.56(2)$, achieving state-of-the-art error suppression for each. With detailed error budgeting, we explore their performance trade-offs and implications for hardware design. This work demonstrates that dynamic circuit approaches satisfy the demands for fault-tolerance and opens new alternative avenues for scalable hardware design. △ Less

Submitted 19 June, 2025; v1 submitted 18 December, 2024; originally announced December 2024.

Comments: 11 pages, 5 figures, Supplementary Information

Scaling and logic in the color code on a superconducting quantum processor

Authors: Nathan Lacroix, Alexandre Bourassa, Francisco J. H. Heras, Lei M. Zhang, Johannes Bausch, Andrew W. Senior, Thomas Edlich, Noah Shutty, Volodymyr Sivak, Andreas Bengtsson, Matt McEwen, Oscar Higgott, Dvir Kafri, Jahan Claes, Alexis Morvan, Zijun Chen, Adam Zalcman, Sid Madhuk, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute , et al. (190 additional authors not shown)

Abstract: Quantum error correction is essential for bridging the gap between the error rates of physical devices and the extremely low logical error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors have focused primarily on the surface code, which offers a high error threshold but poses limitations for logical operations. In contrast, the color code… ▽ More Quantum error correction is essential for bridging the gap between the error rates of physical devices and the extremely low logical error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors have focused primarily on the surface code, which offers a high error threshold but poses limitations for logical operations. In contrast, the color code enables much more efficient logic, although it requires more complex stabilizer measurements and decoding techniques. Measuring these stabilizers in planar architectures such as superconducting qubits is challenging, and so far, realizations of color codes have not addressed performance scaling with code size on any platform. Here, we present a comprehensive demonstration of the color code on a superconducting processor, achieving logical error suppression and performing logical operations. Scaling the code distance from three to five suppresses logical errors by a factor of $Λ_{3/5}$ = 1.56(4). Simulations indicate this performance is below the threshold of the color code, and furthermore that the color code may be more efficient than the surface code with modest device improvements. Using logical randomized benchmarking, we find that transversal Clifford gates add an error of only 0.0027(3), which is substantially less than the error of an idling error correction cycle. We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection (retaining about 75% of the data). Finally, we successfully teleport logical states between distance-three color codes using lattice surgery, with teleported state fidelities between 86.5(1)% and 90.7(1)%. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future. △ Less

Submitted 18 December, 2024; originally announced December 2024.

Journal ref: Nature 645, 614--619 (2025)

Benchmarking Quantum Models for Time-series Forecasting

Authors: Caitlin Jones, Nico Kraus, Pallavi Bhardwaj, Maximilian Adler, Michael Schrödl-Baumann, David Zambrano Manrique

Abstract: Time series forecasting is a valuable tool for many applications, such as stock price predictions, demand forecasting or logistical optimization. There are many well-established statistical and machine learning models that are used for this purpose. Recently in the field of quantum machine learning many candidate models for forecasting have been proposed, however in the absence of theoretical grou… ▽ More Time series forecasting is a valuable tool for many applications, such as stock price predictions, demand forecasting or logistical optimization. There are many well-established statistical and machine learning models that are used for this purpose. Recently in the field of quantum machine learning many candidate models for forecasting have been proposed, however in the absence of theoretical grounds for advantage thorough benchmarking is essential for scientific evaluation. To this end, we performed a benchmarking study using real data of various quantum models, both gate-based and annealing-based, comparing them to the state-of-the-art classical approaches, including extensive hyperparameter optimization. Overall we found that the best classical models outperformed the best quantum models. Most of the quantum models were able to achieve comparable results and for one data set two quantum models outperformed the classical ARIMA model. These results serve as a useful point of comparison for the field of forecasting with quantum machine learning. △ Less

Submitted 18 December, 2024; originally announced December 2024.

Comments: 5 pages, 5 figures

Theory-independent monitoring of the decoherence of a superconducting qubit with generalized contextuality

Authors: Albert Aloy, Matteo Fadel, Thomas D. Galley, Caroline L. Jones, Markus P. Mueller

Abstract: Characterizing the nonclassicality of quantum systems under minimal assumptions is an important challenge for quantum foundations and technology. Here we introduce a theory-independent method of process tomography and perform it on a superconducting qubit. We demonstrate its decoherence without assuming quantum theory or trusting the devices by modelling the system as a general probabilistic theor… ▽ More Characterizing the nonclassicality of quantum systems under minimal assumptions is an important challenge for quantum foundations and technology. Here we introduce a theory-independent method of process tomography and perform it on a superconducting qubit. We demonstrate its decoherence without assuming quantum theory or trusting the devices by modelling the system as a general probabilistic theory. We show that the superconducting system is initially well-described as a quantum bit, but that its realized state space contracts over time, which in quantum terminology indicates its loss of coherence. The system is initially nonclassical in the sense of generalized contextuality: it does not admit of a hidden-variable model where statistically indistinguishable preparations are represented by identical hidden-variable distributions. In finite time, the system becomes noncontextual and hence loses its nonclassicality. Moreover, we demonstrate in a theory-independent way that the system undergoes non-Markovian evolution at late times. Our results extend theory-independent tomography to time-evolving systems, and show how important dynamical physical phenomena can be experimentally monitored without assuming quantum theory. △ Less

Submitted 17 March, 2026; v1 submitted 20 November, 2024; originally announced November 2024.

Comments: 17 pages, 10 figures. V2: close to published version

Journal ref: Nature Communications 17, 2474 (2026)

Universal coarse geometry of spin systems

Authors: Ali Elokl, Corey Jones

Abstract: The prospect of realizing highly entangled states on quantum processors with fundamentally different hardware geometries raises the question: to what extent does a state of a quantum spin system have an intrinsic geometry? In this paper, we propose that both states and dynamics of a spin system have a canonically associated coarse geometry, in the sense of Roe, on the set of sites in the thermodyn… ▽ More The prospect of realizing highly entangled states on quantum processors with fundamentally different hardware geometries raises the question: to what extent does a state of a quantum spin system have an intrinsic geometry? In this paper, we propose that both states and dynamics of a spin system have a canonically associated coarse geometry, in the sense of Roe, on the set of sites in the thermodynamic limit. For a state $φ$ on an (abstract) spin system with an infinite collection of sites $X$, we define a universal coarse structure $\mathcal{E}_φ$ on the set $X$ with the property that a state has decay of correlations with respect to a coarse structure $\mathcal{E}$ on $X$ if and only if $\mathcal{E}_φ\subseteq \mathcal{E}$. We show that under mild assumptions, the coarsely connected completion $(\mathcal{E}_φ)_{con}$ is stable under quasi-local perturbations of the state $φ$. We also develop in parallel a dynamical coarse structure for arbitrary quantum channels, and prove a similar stability result. We show that several order parameters of a state only depend on the coarse structure of an underlying spatial metric, and we establish a basic compatibility between the dynamical coarse structure associated to a quantum circuit $α$ and the coarse structure of the state $ψ\circ α$ where $ψ$ is any product state. △ Less

Submitted 30 December, 2024; v1 submitted 12 November, 2024; originally announced November 2024.

Quantum cellular automata and categorical dualities of spin chains

Authors: Corey Jones, Kylan Schatz, Dominic J. Williamson

Abstract: Dualities play a central role in the study of quantum spin chains, providing insight into the structure of quantum phase diagrams and phase transitions. In this work we study categorical dualities, which are defined as bounded-spread isomorphisms between algebras of symmetry-respecting local operators on a spin chain. We consider generalized global symmetries that correspond to unitary fusion cate… ▽ More Dualities play a central role in the study of quantum spin chains, providing insight into the structure of quantum phase diagrams and phase transitions. In this work we study categorical dualities, which are defined as bounded-spread isomorphisms between algebras of symmetry-respecting local operators on a spin chain. We consider generalized global symmetries that correspond to unitary fusion categories, which are represented by matrix-product operator algebras. A fundamental question about dualities is whether they can be extended to quantum cellular automata on the larger algebra generated by all local operators that respect the unit matrix-product operator. For conventional global symmetries, which are on-site representations of finite groups, this larger algebra is simply the tensor product of algebras associated to individual spins in the chain. We present a solution to the extension problem using the machinery of Doplicher-Haag-Roberts bimodules. Our solution provides a crisp categorical criterion for when an extension of a duality exists. We show that the set of possible extensions form a torsor over the invertible objects in the relevant symmetry category. As a corollary, we obtain a classification result concerning dualities in the group case. △ Less

Submitted 1 April, 2025; v1 submitted 11 October, 2024; originally announced October 2024.

Comments: Comments welcome!

Journal ref: Commun. Math. Phys. 407, 66 (2026)

Observation of disorder-free localization using a (2+1)D lattice gauge theory on a quantum processor

Authors: Gaurav Gyawali, Shashwat Kumar, Yuri D. Lensky, Eliott Rosenberg, Aaron Szasz, Tyler Cochran, Renyi Chen, Amir H. Karamlou, Kostyantyn Kechedzhi, Julia Berndtsson, Tom Westerhout, Abraham Asfaw, Dmitry Abanin, Rajeev Acharya, Laleh Aghababaie Beni, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Brian Ballard, Joseph C. Bardin, Andreas Bengtsson , et al. (197 additional authors not shown)

Abstract: Disorder-induced phenomena in quantum many-body systems pose significant challenges for analytical methods and numerical simulations at relevant time and system scales. To reduce the cost of disorder-sampling, we investigate quantum circuits initialized in states tunable to superpositions over all disorder configurations. In a translationally-invariant lattice gauge theory (LGT), these states can… ▽ More Disorder-induced phenomena in quantum many-body systems pose significant challenges for analytical methods and numerical simulations at relevant time and system scales. To reduce the cost of disorder-sampling, we investigate quantum circuits initialized in states tunable to superpositions over all disorder configurations. In a translationally-invariant lattice gauge theory (LGT), these states can be interpreted as a superposition over gauge sectors. We observe localization in this LGT in the absence of disorder in one and two dimensions: perturbations fail to diffuse despite fully disorder-free evolution and initial states. However, Rényi entropy measurements reveal that superposition-prepared states fundamentally differ from those obtained by direct disorder sampling. Leveraging superposition, we propose an algorithm with a polynomial speedup in sampling disorder configurations, a longstanding challenge in many-body localization studies. △ Less

Submitted 6 July, 2025; v1 submitted 9 October, 2024; originally announced October 2024.

Magic state cultivation: growing T states as cheap as CNOT gates

Authors: Craig Gidney, Noah Shutty, Cody Jones

Abstract: We refine ideas from Knill 1996, Jones 2016, Chamberland 2020, Gidney 2023+2024, Bombin 2024, and Hirano 2024 to efficiently prepare good $|T\rangle$ states. We call our construction "magic state cultivation" because it gradually grows the size and reliability of one state. Cultivation fits inside a surface code patch and uses roughly the same number of physical gates as a lattice surgery CNOT gat… ▽ More We refine ideas from Knill 1996, Jones 2016, Chamberland 2020, Gidney 2023+2024, Bombin 2024, and Hirano 2024 to efficiently prepare good $|T\rangle$ states. We call our construction "magic state cultivation" because it gradually grows the size and reliability of one state. Cultivation fits inside a surface code patch and uses roughly the same number of physical gates as a lattice surgery CNOT gate of equivalent reliability. We estimate the infidelity of cultivation (from injection to idling at distance 15) using a mix of state vector simulation, stabilizer simulation, error enumeration, and Monte Carlo sampling. Compared to prior work, cultivation uses an order of magnitude fewer qubit-rounds to reach logical error rates as low as $2 \cdot 10^{-9}$ when subjected to $10^{-3}$ uniform depolarizing circuit noise. Halving the circuit noise to $5 \cdot 10^{-4}$ improves the achievable logical error rate to $4 \cdot 10^{-11}$. Cultivation's efficiency and strong response to improvements in physical noise suggest that further magic state distillation may never be needed in practice. △ Less

Submitted 26 September, 2024; originally announced September 2024.

Visualizing Dynamics of Charges and Strings in (2+1)D Lattice Gauge Theories

Authors: Tyler A. Cochran, Bernhard Jobst, Eliott Rosenberg, Yuri D. Lensky, Gaurav Gyawali, Norhan Eassa, Melissa Will, Dmitry Abanin, Rajeev Acharya, Laleh Aghababaie Beni, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Juan Atalaya, Ryan Babbush, Brian Ballard, Joseph C. Bardin, Andreas Bengtsson, Alexander Bilmes, Alexandre Bourassa, Jenna Bovaird, Michael Broughton, David A. Browne , et al. (167 additional authors not shown)

Abstract: Lattice gauge theories (LGTs) can be employed to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials. Studying dynamical properties of emergent phases can be challenging as it requires solving many-body problems that are generally beyond perturbative limits. Here, we investigate the dynami… ▽ More Lattice gauge theories (LGTs) can be employed to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials. Studying dynamical properties of emergent phases can be challenging as it requires solving many-body problems that are generally beyond perturbative limits. Here, we investigate the dynamics of local excitations in a $\mathbb{Z}_2$ LGT using a two-dimensional lattice of superconducting qubits. We first construct a simple variational circuit which prepares low-energy states that have a large overlap with the ground state; then we create charge excitations with local gates and simulate their quantum dynamics via a discretized time evolution. As the electric field coupling constant is increased, our measurements show signatures of transitioning from deconfined to confined dynamics. For confined excitations, the electric field induces a tension in the string connecting them. Our method allows us to experimentally image string dynamics in a (2+1)D LGT from which we uncover two distinct regimes inside the confining phase: for weak confinement the string fluctuates strongly in the transverse direction, while for strong confinement transverse fluctuations are effectively frozen. In addition, we demonstrate a resonance condition at which dynamical string breaking is facilitated. Our LGT implementation on a quantum processor presents a novel set of techniques for investigating emergent excitations and string dynamics. △ Less

Submitted 30 June, 2025; v1 submitted 25 September, 2024; originally announced September 2024.

Comments: Main article, methods, and supplemental materials

Journal ref: Nature 642, 315-320 (2025)

Quantum error correction below the surface code threshold

Authors: Rajeev Acharya, Laleh Aghababaie-Beni, Igor Aleiner, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Dave Bacon, Brian Ballard, Joseph C. Bardin, Johannes Bausch, Andreas Bengtsson, Alexander Bilmes, Sam Blackwell, Sergio Boixo, Gina Bortoli, Alexandre Bourassa, Jenna Bovaird, Leon Brill, Michael Broughton, David A. Browne , et al. (224 additional authors not shown)

Abstract: Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. In this work, we present two surface code memories operating below this… ▽ More Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. In this work, we present two surface code memories operating below this threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $Λ$ = 2.14 $\pm$ 0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% $\pm$ 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of 2.4 $\pm$ 0.3. We maintain below-threshold performance when decoding in real time, achieving an average decoder latency of 63 $μ$s at distance-5 up to a million cycles, with a cycle time of 1.1 $μ$s. To probe the limits of our error-correction performance, we run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or 3 $\times$ 10$^9$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms. △ Less

Submitted 24 August, 2024; originally announced August 2024.

Comments: 10 pages, 4 figures, Supplementary Information

Journal ref: Nature 638 (2025) 920-926

Improved accuracy for decoding surface codes with matching synthesis

Authors: Cody Jones

Abstract: We present a method, called matching synthesis, for decoding quantum codes that produces an enhanced assignment of errors from an ensemble of decoders. We apply matching synthesis to develop a decoder named Libra, and show in simulations that Libra increases the error-suppression ratio $Λ$ by about $10\%$. Matching synthesis takes the solutions of an ensemble of approximate solvers for the minimum… ▽ More We present a method, called matching synthesis, for decoding quantum codes that produces an enhanced assignment of errors from an ensemble of decoders. We apply matching synthesis to develop a decoder named Libra, and show in simulations that Libra increases the error-suppression ratio $Λ$ by about $10\%$. Matching synthesis takes the solutions of an ensemble of approximate solvers for the minimum-weight hypergraph matching problem, and produces a new solution that combines the best local solutions, where locality depends on the hypergraph. We apply matching synthesis to an example problem of decoding surface codes with error correlations in the conventional circuit model, which induces a hypergraph with hyperedges that are local in space and time. We call the matching-synthesis decoder Libra, and in this example the ensemble consists of correlated minimum-weight matching using a different hypergraph with randomly perturbed error probabilities for each ensemble member. Furthermore, we extend matching synthesis to perform summation of probability for multiple low-weight solutions and at small computational overhead, approximating the probability of an equivalence class; in our surface code problem, this shows a modest additional benefit. We show that matching synthesis has favorable scaling properties where accuracy begins to saturate with an ensemble size of 60, and we remark on pathways to real-time decoding at near-optimal decoding accuracy if one has an accurate model for the distribution of errors. △ Less

Submitted 22 August, 2024; originally announced August 2024.

Violating Bell's inequality in gate-defined quantum dots

Authors: Paul Steinacker, Tuomo Tanttu, Wee Han Lim, Nard Dumoulin Stuyck, MengKe Feng, Santiago Serrano, Ensar Vahapoglu, Rocky Y. Su, Jonathan Y. Huang, Cameron Jones, Kohei M. Itoh, Fay E. Hudson, Christopher C. Escott, Andrea Morello, Andre Saraiva, Chih Hwan Yang, Andrew S. Dzurak, Arne Laucht

Abstract: Superior computational power promised by quantum computers utilises the fundamental quantum mechanical principle of entanglement. However, achieving entanglement and verifying that the generated state does not follow the principle of local causality has proven difficult for spin qubits in gate-defined quantum dots, as it requires simultaneously high concurrence values and readout fidelities to bre… ▽ More Superior computational power promised by quantum computers utilises the fundamental quantum mechanical principle of entanglement. However, achieving entanglement and verifying that the generated state does not follow the principle of local causality has proven difficult for spin qubits in gate-defined quantum dots, as it requires simultaneously high concurrence values and readout fidelities to break the classical bound imposed by Bell's inequality. Here we employ heralded initialization and calibration via gate set tomography (GST), to reduce all relevant errors and push the fidelities of the full 2-qubit gate set above 99 %, including state preparation and measurement (SPAM). We demonstrate a 97.17 % Bell state fidelity without correcting for readout errors and violate Bell's inequality with a Bell signal of S = 2.731 close to the theoretical maximum of $2\sqrt{2}$. Our measurements exceed the classical limit even at elevated temperatures of 1.1 K or entanglement lifetimes of 100 $μs$. △ Less

Submitted 16 August, 2024; v1 submitted 22 July, 2024; originally announced July 2024.

Comments: 19 pages, 5 main figures, 9 extended data figures

MSC Class: 81P68; 81-05

Thermalization and Criticality on an Analog-Digital Quantum Simulator

Authors: Trond I. Andersen, Nikita Astrakhantsev, Amir H. Karamlou, Julia Berndtsson, Johannes Motruk, Aaron Szasz, Jonathan A. Gross, Alexander Schuckert, Tom Westerhout, Yaxing Zhang, Ebrahim Forati, Dario Rossi, Bryce Kobrin, Agustin Di Paolo, Andrey R. Klots, Ilya Drozdov, Vladislav D. Kurilovich, Andre Petukhov, Lev B. Ioffe, Andreas Elben, Aniket Rath, Vittorio Vitale, Benoit Vermersch, Rajeev Acharya, Laleh Aghababaie Beni , et al. (202 additional authors not shown)

Abstract: Understanding how interacting particles approach thermal equilibrium is a major challenge of quantum simulators. Unlocking the full potential of such systems toward this goal requires flexible initial state preparation, precise time evolution, and extensive probes for final state characterization. We present a quantum simulator comprising 69 superconducting qubits which supports both universal qua… ▽ More Understanding how interacting particles approach thermal equilibrium is a major challenge of quantum simulators. Unlocking the full potential of such systems toward this goal requires flexible initial state preparation, precise time evolution, and extensive probes for final state characterization. We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution, with performance beyond the reach of classical simulation in cross-entropy benchmarking experiments. Emulating a two-dimensional (2D) XY quantum magnet, we leverage a wide range of measurement techniques to study quantum states after ramps from an antiferromagnetic initial state. We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions attributed to the interplay between quantum and classical coarsening of the correlated domains. This interpretation is corroborated by injecting variable energy density into the initial state, which enables studying the effects of the eigenstate thermalization hypothesis (ETH) in targeted parts of the eigenspectrum. Finally, we digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization. These results establish the efficacy of superconducting analog-digital quantum processors for preparing states across many-body spectra and unveiling their thermalization dynamics. △ Less

Submitted 8 July, 2024; v1 submitted 27 May, 2024; originally announced May 2024.

Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling

Authors: Archismita Dalal, Iraitz Montalban, Narendra N. Hegade, Alejandro Gomez Cadavid, Enrique Solano, Abhishek Awasthi, Davide Vodola, Caitlin Jones, Horst Weiss, Gernot Füchsel

Abstract: We study a job shop scheduling problem for an automatized robot in a high-throughput laboratory and a travelling salesperson problem with recently proposed digitized counterdiabatic quantum optimization (DCQO)algorithms. In DCQO, we find the solution of an optimization problem via an adiabatic quantum dynamics, which is accelerated with counterdiabatic protocols. Thereafter, we digitize the global… ▽ More We study a job shop scheduling problem for an automatized robot in a high-throughput laboratory and a travelling salesperson problem with recently proposed digitized counterdiabatic quantum optimization (DCQO)algorithms. In DCQO, we find the solution of an optimization problem via an adiabatic quantum dynamics, which is accelerated with counterdiabatic protocols. Thereafter, we digitize the global unitary to encode it in a digital quantum computer. For the job-shop scheduling problem, we aim at finding the optimal schedule for a robot executing a number of tasks under specific constraints, such that the total execution time of the process is minimized. For the traveling salesperson problem, the goal is to find the path that covers all cities and is associated with the shortest traveling distance. We consider both hybrid and pure versions of DCQO algorithms and benchmark the performance against digitized quantum annealing and the quantum approximate optimization algorithm (QAOA). In comparison to QAOA, the DCQO solution is improved by several orders of magnitude in success probability using the same number of two-qubit gates. Moreover, we implement our algorithms on cloud-based superconducting and trapped-ion quantum processors. Our results demonstrate that circuit compression using counterdiabatic protocols is amenable to current NISQ hardware and can solve logistics scheduling problems, where other digital quantum algorithms show insufficient performance. △ Less

Submitted 5 February, 2025; v1 submitted 24 May, 2024; originally announced May 2024.

Comments: 13 pages, 10 figures

Journal ref: Phys. Rev. Applied 22, 064068 (2024)

Enhanced Whispering Gallery Mode Phase Shift using Indistinguishable Photon Pairs

Authors: Callum Jones, Antonio Vidiella-Barranco, Jolly Xavier, Frank Vollmer

Abstract: We present a theoretical investigation of a whispering gallery mode (WGM) resonator coupled to a Mach-Zehnder interferometer (MZI) and show a bimodal coincidence transmission spectrum when the input state is an indistinguishable photon pair. This is due to the doubled WGM phase shift experienced by the path-entangled state in the interferometer. Further, we model the noise in a WGM resonance shift… ▽ More We present a theoretical investigation of a whispering gallery mode (WGM) resonator coupled to a Mach-Zehnder interferometer (MZI) and show a bimodal coincidence transmission spectrum when the input state is an indistinguishable photon pair. This is due to the doubled WGM phase shift experienced by the path-entangled state in the interferometer. Further, we model the noise in a WGM resonance shift measurement comparing photon pairs with a coherent state. At least a four-fold improvement in the signal-to-noise ratio (SNR) is possible, with clear implications for quantum-enhanced WGM sensing. △ Less

Submitted 26 April, 2024; originally announced April 2024.

Comments: 9 pages, 9 figures

Potential of quantum scientific machine learning applied to weather modelling

Authors: Ben Jaderberg, Antonio A. Gentile, Atiyo Ghosh, Vincent E. Elfving, Caitlin Jones, Davide Vodola, John Manobianco, Horst Weiss

Abstract: In this work we explore how quantum scientific machine learning can be used to tackle the challenge of weather modelling. Using parameterised quantum circuits as machine learning models, we consider two paradigms: supervised learning from weather data and physics-informed solving of the underlying equations of atmospheric dynamics. In the first case, we demonstrate how a quantum model can be train… ▽ More In this work we explore how quantum scientific machine learning can be used to tackle the challenge of weather modelling. Using parameterised quantum circuits as machine learning models, we consider two paradigms: supervised learning from weather data and physics-informed solving of the underlying equations of atmospheric dynamics. In the first case, we demonstrate how a quantum model can be trained to accurately reproduce real-world global stream function dynamics at a resolution of 4°. We detail a number of problem-specific classical and quantum architecture choices used to achieve this result. Subsequently, we introduce the barotropic vorticity equation (BVE) as our model of the atmosphere, which is a $3^{\text{rd}}$ order partial differential equation (PDE) in its stream function formulation. Using the differentiable quantum circuits algorithm, we successfully solve the BVE under appropriate boundary conditions and use the trained model to predict unseen future dynamics to high accuracy given an artificial initial weather state. Whilst challenges remain, our results mark an advancement in terms of the complexity of PDEs solved with quantum scientific machine learning. △ Less

Submitted 12 April, 2024; originally announced April 2024.

Comments: 16 pages, 5 figures

On the significance of Wigner's Friend in contexts beyond quantum foundations

Authors: Caroline L. Jones, Markus P. Mueller

Abstract: There has been a surge of recent interest in the Wigner's Friend paradox, sparking several novel thought experiments and no-go theorems. The main narrative has been that Wigner's Friend highlights a counterintuitive feature that is unique to quantum theory, and which is closely related to the quantum measurement problem. Here, we challenge this view. We argue that the gist of the Wigner's Friend p… ▽ More There has been a surge of recent interest in the Wigner's Friend paradox, sparking several novel thought experiments and no-go theorems. The main narrative has been that Wigner's Friend highlights a counterintuitive feature that is unique to quantum theory, and which is closely related to the quantum measurement problem. Here, we challenge this view. We argue that the gist of the Wigner's Friend paradox can be reproduced without assuming quantum physics, and that it underlies a much broader class of enigmas in the foundations of physics and philosophy. To show this, we first consider several recently proposed Extended Wigner's Friend scenarios, and demonstrate that some of their implications for the absoluteness of observations can be reproduced by classical thought experiments that involve the duplication of agents. Crucially, some of these classical scenarios are technologically much easier to implement than their quantum counterparts. Then, we argue that the essential structural ingredient of all these scenarios is a feature that we call "Restriction A": that a physical theory cannot give us a probabilistic description of the observations of all agents. Finally, we argue that this difficulty is at the core of other puzzles in the foundations of physics and philosophy, and demonstrate this explicitly for cosmology's Boltzmann brain problem. Our analysis suggests that Wigner's Friend should be studied in a larger context, addressing a frontier of human knowledge beyond quantum foundations: to obtain reliable predictions for experiments in which these predictions can be privately but not intersubjectively verified. △ Less

Submitted 19 June, 2026; v1 submitted 13 February, 2024; originally announced February 2024.

Comments: 30+7 pages, 3 figures. Previous title: "Thinking twice inside the box: is Wigner's friend really quantum?''. Accepted for publication in Quantum, v4: corrected license

Journal ref: Quantum 10, 2147 (2026)

Spin-bounded correlations: rotation boxes within and beyond quantum theory

Authors: Albert Aloy, Thomas D. Galley, Caroline L. Jones, Stefan L. Ludescher, Markus P. Mueller

Abstract: How can detector click probabilities respond to spatial rotations around a fixed axis, in any possible physical theory? Here, we give a thorough mathematical analysis of this question in terms of "rotation boxes", which are analogous to the well-known notion of non-local boxes. We prove that quantum theory admits the most general rotational correlations for spins 0, 1/2, and 1, but we describe a m… ▽ More How can detector click probabilities respond to spatial rotations around a fixed axis, in any possible physical theory? Here, we give a thorough mathematical analysis of this question in terms of "rotation boxes", which are analogous to the well-known notion of non-local boxes. We prove that quantum theory admits the most general rotational correlations for spins 0, 1/2, and 1, but we describe a metrological game where beyond-quantum resources of spin 3/2 outperform all quantum resources of the same spin. We prove a multitude of fundamental results about these correlations, including an exact convex characterization of the spin-1 correlations, a Tsirelson-type inequality for spins 3/2 and higher, and a proof that the general spin-J correlations provide an efficient outer SDP approximation to the quantum set. Furthermore, we review and consolidate earlier results that hint at a wealth of applications of this formalism: a theory-agnostic semi-device-independent randomness generator, an exact characterization of the quantum (2,2,2)-Bell correlations in terms of local symmetries, and the derivation of multipartite Bell witnesses. Our results illuminate the foundational question of how space constrains the structure of quantum theory, they build a bridge between semi-device-independent quantum information and spacetime physics, and they demonstrate interesting relations to topics such as entanglement witnesses, spectrahedra, and orbitopes. △ Less

Submitted 18 November, 2024; v1 submitted 14 December, 2023; originally announced December 2023.

Comments: 29+21 pages, 9 figures. V2: Minor corrections, close to published version

Journal ref: Commun. Math. Phys. 405, 292 (2024)

New circuits and an open source decoder for the color code

Authors: Craig Gidney, Cody Jones

Abstract: We present two new color code circuits: one inspired by superdense coding and the other based on a middle-out strategy where the color code state appears halfway between measurements. We also present ``Chromobius'', an open source implementation of the möbius color code decoder. Using Chromobius, we show our new circuits reduce the performance gap between color codes and surface codes. Under unifo… ▽ More We present two new color code circuits: one inspired by superdense coding and the other based on a middle-out strategy where the color code state appears halfway between measurements. We also present ``Chromobius'', an open source implementation of the möbius color code decoder. Using Chromobius, we show our new circuits reduce the performance gap between color codes and surface codes. Under uniform depolarizing noise with a noise strength of $0.1\%$, the middle-out color code circuit achieves a teraquop footprint of 1250 qubits (vs 650 for surface codes decoded by correlated matching). Finally, we highlight that Chromobius decodes toric color codes better when given *less* information, suggesting there's substantial room for improvement in color code decoders. △ Less

Submitted 14 December, 2023; originally announced December 2023.

Yoked surface codes

Authors: Craig Gidney, Michael Newman, Peter Brooks, Cody Jones

Abstract: We nearly triple the number of logical qubits per physical qubit of surface codes in the teraquop regime by concatenating them into high-density parity check codes. These "yoked surface codes" are arrayed in a rectangular grid, with parity checks (yokes) measured along each row, and optionally along each column, using lattice surgery. Our construction assumes no additional connectivity beyond a ne… ▽ More We nearly triple the number of logical qubits per physical qubit of surface codes in the teraquop regime by concatenating them into high-density parity check codes. These "yoked surface codes" are arrayed in a rectangular grid, with parity checks (yokes) measured along each row, and optionally along each column, using lattice surgery. Our construction assumes no additional connectivity beyond a nearest neighbor square qubit grid operating at a physical error rate of $10^{-3}$. △ Less

Submitted 7 December, 2023; originally announced December 2023.

Comments: 23 pages, 16 figures, 1 table

`Maser-in-a-Shoebox': a portable plug-and-play maser device at room-temperature and zero magnetic-field

Authors: Wern Ng, Yongqiang Wen, Max Attwood, Daniel C Jones, Mark Oxborrow, Neil McN. Alford, Daan M. Arroo

Abstract: Masers, the microwave analogues of lasers, have seen a renaissance owing to the discovery of gain media that mase at room-temperature and zero-applied magnetic field. However, despite the ease with which the devices can be demonstrated under ambient conditions, achieving the ubiquity and portability which lasers enjoy has to date remained challenging. We present a maser device with a miniaturized… ▽ More Masers, the microwave analogues of lasers, have seen a renaissance owing to the discovery of gain media that mase at room-temperature and zero-applied magnetic field. However, despite the ease with which the devices can be demonstrated under ambient conditions, achieving the ubiquity and portability which lasers enjoy has to date remained challenging. We present a maser device with a miniaturized maser cavity, gain material and laser pump source that fits within the size of a shoebox. The gain medium used is pentacene-doped in para-terphenyl and it is shown to give a strong masing signal with a peak power of -5 dBm even within a smaller form factor. The device is also shown to mase at different frequencies within a small range of 1.5 MHz away from the resonant frequency. The portability and simplicity of the device, which weighs under 5 kg, paves the way for demonstrators particularly in the areas of low-noise amplifiers, quantum sensors, cavity quantum electrodynamics and long-range communications. △ Less

Submitted 13 October, 2023; originally announced October 2023.

Journal ref: Appl. Phys. Lett. 124, 044004 (2024)

Learning to Decode the Surface Code with a Recurrent, Transformer-Based Neural Network

Authors: Johannes Bausch, Andrew W Senior, Francisco J H Heras, Thomas Edlich, Alex Davies, Michael Newman, Cody Jones, Kevin Satzinger, Murphy Yuezhen Niu, Sam Blackwell, George Holland, Dvir Kafri, Juan Atalaya, Craig Gidney, Demis Hassabis, Sergio Boixo, Hartmut Neven, Pushmeet Kohli

Abstract: Quantum error-correction is a prerequisite for reliable quantum computation. Towards this goal, we present a recurrent, transformer-based neural network which learns to decode the surface code, the leading quantum error-correction code. Our decoder outperforms state-of-the-art algorithmic decoders on real-world data from Google's Sycamore quantum processor for distance 3 and 5 surface codes. On di… ▽ More Quantum error-correction is a prerequisite for reliable quantum computation. Towards this goal, we present a recurrent, transformer-based neural network which learns to decode the surface code, the leading quantum error-correction code. Our decoder outperforms state-of-the-art algorithmic decoders on real-world data from Google's Sycamore quantum processor for distance 3 and 5 surface codes. On distances up to 11, the decoder maintains its advantage on simulated data with realistic noise including cross-talk, leakage, and analog readout signals, and sustains its accuracy far beyond the 25 cycles it was trained on. Our work illustrates the ability of machine learning to go beyond human-designed algorithms by learning from data directly, highlighting machine learning as a strong contender for decoding in quantum computers. △ Less

Submitted 9 October, 2023; originally announced October 2023.

MSC Class: 81P73; 68T07 ACM Class: I.2.0; J.2

Journal ref: Nature 635, 834-840 (2024)

An index for quantum cellular automata on fusion spin chains

Authors: Corey Jones, Junhwi Lim

Abstract: Interpreting the GNVW index for 1D quantum cellular automata (QCA) in terms of the Jones index for subfactors leads to a generalization of the index defined for QCA on more general abstract spin chains. These include fusion spin chains, which arise as the local operators invariant under a global (categorical/MPO) symmetry, and as the boundary operators of 2D topological codes. We show that for the… ▽ More Interpreting the GNVW index for 1D quantum cellular automata (QCA) in terms of the Jones index for subfactors leads to a generalization of the index defined for QCA on more general abstract spin chains. These include fusion spin chains, which arise as the local operators invariant under a global (categorical/MPO) symmetry, and as the boundary operators of 2D topological codes. We show that for the fusion spin chains built from the fusion category $\mathbf{Fib}$, the index is a complete invariant for the group of QCA modulo finite depth circuits. △ Less

Submitted 18 March, 2024; v1 submitted 19 September, 2023; originally announced September 2023.

Comments: 22 pages

An Optimization Case Study for solving a Transport Robot Scheduling Problem on Quantum-Hybrid and Quantum-Inspired Hardware

Authors: Dominik Leib, Tobias Seidel, Sven Jäger, Raoul Heese, Caitlin Isobel Jones, Abhishek Awasthi, Astrid Niederle, Michael Bortz

Abstract: We present a comprehensive case study comparing the performance of D-Waves' quantum-classical hybrid framework, Fujitsu's quantum-inspired digital annealer, and Gurobi's state-of-the-art classical solver in solving a transport robot scheduling problem. This problem originates from an industrially relevant real-world scenario. We provide three different models for our problem following different de… ▽ More We present a comprehensive case study comparing the performance of D-Waves' quantum-classical hybrid framework, Fujitsu's quantum-inspired digital annealer, and Gurobi's state-of-the-art classical solver in solving a transport robot scheduling problem. This problem originates from an industrially relevant real-world scenario. We provide three different models for our problem following different design philosophies. In our benchmark, we focus on the solution quality and end-to-end runtime of different model and solver combinations. We find promising results for the digital annealer and some opportunities for the hybrid quantum annealer in direct comparison with Gurobi. Our study provides insights into the workflow for solving an application-oriented optimization problem with different strategies, and can be useful for evaluating the strengths and weaknesses of different approaches. △ Less

Submitted 24 October, 2023; v1 submitted 18 September, 2023; originally announced September 2023.

Journal ref: Sci Rep 13, 18743 (2023)

Local topological order and boundary algebras

Authors: Corey Jones, Pieter Naaijkens, David Penneys, Daniel Wallick

Abstract: We introduce a set of axioms for locally topologically ordered quantum spin systems in terms of nets of local ground state projections, and we show they are satisfied by Kitaev's Toric Code and Levin-Wen type models. For a locally topologically ordered spin system on $\mathbb{Z}^{k}$, we define a local net of boundary algebras on $\mathbb{Z}^{k-1}$, which provides a mathematically precise algebrai… ▽ More We introduce a set of axioms for locally topologically ordered quantum spin systems in terms of nets of local ground state projections, and we show they are satisfied by Kitaev's Toric Code and Levin-Wen type models. For a locally topologically ordered spin system on $\mathbb{Z}^{k}$, we define a local net of boundary algebras on $\mathbb{Z}^{k-1}$, which provides a mathematically precise algebraic description of the holographic dual of the bulk topological order. We construct a canonical quantum channel so that states on the boundary quasi-local algebra parameterize bulk-boundary states without reference to a boundary Hamiltonian. As a corollary, we obtain a new proof of a recent result of Ogata [Ann. H. Poincaré 25, 2024] that the bulk cone von Neumann algebra in the Toric Code is of type $\rm{II}$, and we show that Levin-Wen models can have cone algebras of type $\rm{III}$. Finally, we argue that the braided tensor category of DHR bimodules for the net of boundary algebras characterizes the bulk topological order in (2+1)D, and can also be used to characterize the topological order of boundary states. △ Less

Submitted 12 February, 2025; v1 submitted 24 July, 2023; originally announced July 2023.

Comments: 44 pages, many figures. This version includes an appendix by Masaki Izumi further analyzing the type of the cone algebras

MSC Class: 81T05; 81T25 (primary); 18M20; 46L37; 46L60; 81V27 (secondary)

Journal ref: Forum of Math., Sigma 13:e135 (2025)

Dynamics of magnetization at infinite temperature in a Heisenberg spin chain

Authors: Eliott Rosenberg, Trond Andersen, Rhine Samajdar, Andre Petukhov, Jesse Hoke, Dmitry Abanin, Andreas Bengtsson, Ilya Drozdov, Catherine Erickson, Paul Klimov, Xiao Mi, Alexis Morvan, Matthew Neeley, Charles Neill, Rajeev Acharya, Richard Allen, Kyle Anderson, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Juan Atalaya, Joseph Bardin, A. Bilmes, Gina Bortoli , et al. (156 additional authors not shown)

Abstract: Understanding universal aspects of quantum dynamics is an unresolved problem in statistical mechanics. In particular, the spin dynamics of the 1D Heisenberg model were conjectured to belong to the Kardar-Parisi-Zhang (KPZ) universality class based on the scaling of the infinite-temperature spin-spin correlation function. In a chain of 46 superconducting qubits, we study the probability distributio… ▽ More Understanding universal aspects of quantum dynamics is an unresolved problem in statistical mechanics. In particular, the spin dynamics of the 1D Heisenberg model were conjectured to belong to the Kardar-Parisi-Zhang (KPZ) universality class based on the scaling of the infinite-temperature spin-spin correlation function. In a chain of 46 superconducting qubits, we study the probability distribution, $P(\mathcal{M})$, of the magnetization transferred across the chain's center. The first two moments of $P(\mathcal{M})$ show superdiffusive behavior, a hallmark of KPZ universality. However, the third and fourth moments rule out the KPZ conjecture and allow for evaluating other theories. Our results highlight the importance of studying higher moments in determining dynamic universality classes and provide key insights into universal behavior in quantum systems. △ Less

Submitted 4 April, 2024; v1 submitted 15 June, 2023; originally announced June 2023.

Journal ref: Science 384, 48-53 (2024)

Stable Quantum-Correlated Many Body States through Engineered Dissipation

Authors: X. Mi, A. A. Michailidis, S. Shabani, K. C. Miao, P. V. Klimov, J. Lloyd, E. Rosenberg, R. Acharya, I. Aleiner, T. I. Andersen, M. Ansmann, F. Arute, K. Arya, A. Asfaw, J. Atalaya, J. C. Bardin, A. Bengtsson, G. Bortoli, A. Bourassa, J. Bovaird, L. Brill, M. Broughton, B. B. Buckley, D. A. Buell, T. Burger , et al. (142 additional authors not shown)

Abstract: Engineered dissipative reservoirs have the potential to steer many-body quantum systems toward correlated steady states useful for quantum simulation of high-temperature superconductivity or quantum magnetism. Using up to 49 superconducting qubits, we prepared low-energy states of the transverse-field Ising model through coupling to dissipative auxiliary qubits. In one dimension, we observed long-… ▽ More Engineered dissipative reservoirs have the potential to steer many-body quantum systems toward correlated steady states useful for quantum simulation of high-temperature superconductivity or quantum magnetism. Using up to 49 superconducting qubits, we prepared low-energy states of the transverse-field Ising model through coupling to dissipative auxiliary qubits. In one dimension, we observed long-range quantum correlations and a ground-state fidelity of 0.86 for 18 qubits at the critical point. In two dimensions, we found mutual information that extends beyond nearest neighbors. Lastly, by coupling the system to auxiliaries emulating reservoirs with different chemical potentials, we explored transport in the quantum Heisenberg model. Our results establish engineered dissipation as a scalable alternative to unitary evolution for preparing entangled many-body states on noisy quantum processors. △ Less

Submitted 5 April, 2024; v1 submitted 26 April, 2023; originally announced April 2023.

Journal ref: Science 383, 1332-1337 (2024)