Chris N. Self

Computing with many encoded logical qubits beyond break-even

Shival Dasu [1], Matthew DeCross [1], Andrew Y. Guo [1], Ali Lavasani [1], Jan Behrends [2], Asmae Benhemou [3], Yi-Hsiang Chen [1], Karl Mayer [1], Chris N. Self [2], Selwyn Simsek [3], Basudha Srivastava [2,1], M. S. Allman, Jake Arkinstall [2], Justin G. Bohnet [1], Nathaniel Q. Burdick [4,1], J. P. Campora, Alex Chernoguzov [1], Samuel F. Cooper [1], Robert D. Delaney [1], Joan M. Dreiling [1], Brian Estey [1], Caroline Figgatt [1], Cameron Foltz [1], John P. Gaebler [1], Alex Hall [1], Craig A. Holliman [5], Ali A. Husain [4], Akhil Isanaka [1], Colin J. Kennedy [1], Yuga Kodama [5], Nikhil Kotibhaskar [3], Nathan K. Lysne [5], Ivaylo S. Madjarov [1], Michael Mills [1], Alistair R. Milne [3], Brian Neyenhuis [1], Annie J. Park [1], Anthony Ransford [1], Adam P. Reed [1], Steven J. Sanders [1], Charles H. Baldwin [1], David Hayes [1], Ben Criger [2], Andrew C. Potter [1], David Amaro [3]

Abstract

High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementing high-rate codes at a scale that both frustrates classical computing and improves performance by encoding requires both high fidelity gates and long-range qubit connectivity -- both of which are offered by trapped-ion quantum computers. Here, we demonstrate computations that outperform their unencoded counterparts in the high-rate $[[ k+2,\, k,\, 2 ]]$ iceberg quantum error detecting (QED) and $[[ (k_2 + 2)(k_1 + 2),\, k_2k_1,\, 4 ]]$ two-level concatenated iceberg QEC codes, using the 98-qubit Quantinuum Helios trapped-ion quantum processor. Utilizing new gadgets for encoded operations, we realize this "beyond break-even" performance with reasonable postselection rates across a range of fault-tolerant (FT) and partially-fault-tolerant (pFT) component and application benchmarks with between $48$ and $94$ logical qubits. These benchmarks include FT state preparation and measurement, QEC cycle benchmarking, logical gate benchmarking, GHZ state preparation, and a pFT quantum simulation of the three-dimensional $XY$ model of quantum magnetism. Additionally, we illustrate that postselection rates can be suppressed by increasing the code distance via concatenation. Our results represent state-of-the-art logical component and state fidelities and provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-classical-scale computation.

Certified randomness amplification by dynamically probing remote random quantum states

Minzhao Liu [1], Pradeep Niroula [1], Matthew DeCross [2], Cameron Foreman [3], Wen Yu Kon [1], Ignatius William Primaatmaja [1,2], M. S. Allman, J. P. Campora, Akhil Isanaka [2], Kartik Singhal [2], Omar Amer [1], Shouvanik Chakrabarti [1], Kaushik Chakraborty [1], Samuel F. Cooper [2], Robert D. Delaney [2], Joan M. Dreiling [2], Brian Estey [2], Caroline Figgatt [2], Cameron Foltz [2], John P. Gaebler [2], Alex Hall [2], Zichang He [1], Craig A. Holliman [4], Travis S. Humble [5], Shih-Han Hung [6], Ali A. Husain [7], Yuwei Jin [1], Fatih Kaleoglu [1], Colin J. Kennedy [2], Nikhil Kotibhaskar [3], Nathan K. Lysne [4], Ivaylo S. Madjarov [2], Michael Mills [2], Alistair R. Milne [3], Kevin Milner [3], Louis Narmour [2], Sivaprasad Omanakuttan [1], Annie J. Park [2], Michael A. Perlin [1], Adam P. Reed [2], Chris N. Self [8], Matthew Steinberg [1], David T. Stephen [2], Joseph Sullivan [1], Alex Chernoguzov [2], Florian J. Curchod [8], Anthony Ransford [2], Justin G. Bohnet [2], Brian Neyenhuis [2], Michael Foss-Feig [2], Rob Otter [1], Ruslan Shaydulin [1]

Abstract

Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into nearly perfect randomness, but prior demonstrations have required physically co-located, loophole-free Bell tests, constraining the feasibility of remote operation. Here we realize certified randomness amplification across a network by dynamically probing large, entangled quantum states on Quantinuum's 98-qubit Helios trapped-ion quantum processor. Our protocol is secure even if the remote device acts maliciously or is compromised by an intercepting adversary, provided the samples are generated quickly enough to preclude classical simulation of the quantum circuits. We stream quantum gates in real time to the quantum processor, maintain quantum state coherence for $\approx 0.9$ seconds, and then reveal the measurement bases to the quantum processor only milliseconds before measurement. This limits the time for classical spoofing to 30 ms and constrains the location of hypothetical adversaries to a $4{,}500$ km radius. We achieve a fidelity of 0.586 on random circuits with 64 qubits and 276 two-qubit gates, enabling the amplification of realistic imperfect randomness with a low entropy rate into nearly perfect randomness.

Measuring Correlation and Entanglement between Molecular Orbitals on a Trapped-Ion Quantum Computer

Gabriel Greene-Diniz [1], Chris N. Self [2], Michal Krompiec [1], Luuk Coopmans [2], Marcello Benedetti [2,1], David Muñoz Ramo, Matthias Rosenkranz [2]

Abstract

Quantifying correlation and entanglement between molecular orbitals can elucidate the role of quantum effects in strongly correlated reaction processes. However, accurately storing the wavefunction for a classical computation of those quantities can be prohibitive. Here we use the Quantinuum H1-1 trapped-ion quantum computer to calculate von Neumann entropies which quantify the orbital correlation and entanglement in a strongly correlated molecular system relevant to lithium-ion batteries (vinylene carbonate interacting with an O$_2$ molecule). As shown in previous works, fermionic superselection rules decrease correlations and reduce measurement overheads for constructing orbital reduced density matrices. Taking into account superselection rules we further reduce the number of measurements by finding commuting sets of Pauli operators. Using low overhead noise reduction techniques we calculate von Neumann entropies in excellent agreement with noiseless benchmarks, indicating that correlations and entanglement between molecular orbitals can be accurately estimated from a quantum computation. Our results show that the one-orbital entanglement vanishes unless opposite-spin open shell configurations are present in the wavefunction.

Protecting Expressive Circuits with a Quantum Error Detection Code

Chris N. Self [1], Marcello Benedetti [1], David Amaro [1]

Abstract

A successful quantum error correction protocol would allow quantum computers to run algorithms without suffering from the effects of noise. However, fully fault-tolerant quantum error correction is too resource intensive for existing quantum computers. In this context we develop a quantum error detection code for implementations on existing trapped-ion computers. By encoding $k$ logical qubits into $k+2$ physical qubits, this code presents fault-tolerant state initialisation and syndrome measurement circuits that can detect any single-qubit error. It provides a universal set of local and global logical rotations that have physical support on only two qubits. A high-fidelity -- though non fault-tolerant -- compilation of this universal gate set is possible thanks to the two-qubit physical rotations present in trapped-ion computers with all-to-all connectivity. Given the particular structure of the logical operators, we nickname it the Iceberg code. We demonstrate the protection of circuits of 8 logical qubits with up to 256 layers, saturate the logical quantum volume of $2^8$, and show the positive effect of increasing the frequency of syndrome measurements within the circuit. These results illustrate the practical usefulness of the Iceberg code to protect expressive circuits on existing trapped-ion quantum computers.