arXiv subjects

Nathan K. Lysne

Publications and source records attributed to Nathan K. Lysne.

6 recordsLinked to original sources

arXiv2026

Computing with many encoded logical qubits beyond break-even

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.

quant-ph↗

arXiv2025

Observation of a Topological Berry Phase with a Single Phonon in an Ion Microtrap Array

Controlled quantum mechanical motion of trapped atomic ions can be used to simulate and explore collective quantum phenomena and to process quantum information. Groups of cold atomic ions in an externally applied trapping potential self-organize into "Coulomb crystals" due to their mutual electrostatic repulsion. The motion of the ions in these crystals is strongly coupled, and the eigenmodes of motion all involve multiple ions. While this enables studies of many-body physics, it limits the flexibility and tunability of the system as a quantum platform. Here, we demonstrate an array of trapped ions in individual trapping sites whose motional modes can be controllably coupled and decoupled by tuning the local applied confining potential for each ion. We show that a single motional quantum, or phonon, can be coherently shared among two or three ions confined at the vertices of an equilateral triangle 30 $μ$m on a side. We can adiabatically tune the ion participation in the motional modes around a closed contour in configuration space, observing that the single-phonon wavefunction acquires a topological Berry phase if the contour encircles a conical intersection of motional eigenvalue surfaces. We observe this phase by single-phonon interference and study its breakdown as the motional mode tuning becomes non-adiabiatic. Our results show that precise, individual quantum control of ion motion in a two-dimensional array can provide unique access to quantum multi-body effects.

quant-ph↗

arXiv2025

Certified randomness amplification by dynamically probing remote random quantum states

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.

quant-ph↗

arXiv2025

Order-of-magnitude extension of qubit lifetimes with a decoherence-free subspace quantum error correction code

Constructing an efficient and robust quantum memory is central to the challenge of engineering feasible quantum computer architectures. Quantum error correction codes can solve this problem in theory, but without careful design it can introduce daunting requirements that call for machines many orders of magnitude larger than what is available today. Bringing these requirements down can often be achieved by tailoring the codes to mitigate the specific forms of noise known to be present. Using a Quantinuum H1 quantum computer, we report on a robust quantum memory design using a concatenated code, with the low-level code designed to mitigate the dominant source of memory error, and a higher-level error correction scheme to enable robust computation. The resulting encoding scheme, known as a decoherence-free subspace quantum error correction code, is characterized for long probe times, and shown to extend the memory time by over an order of magnitude compared to physical qubits.

quant-ph↗

arXiv2020

Quantifying the sensitivity to errors in analog quantum simulation

Quantum simulators are widely seen as one of the most promising near-term applications of quantum technologies. However, it remains unclear to what extent a noisy device can output reliable results in the presence of unavoidable imperfections. Here we propose a framework to characterize the performance of quantum simulators by linking the robustness of measured quantum expectation values to the spectral properties of the output observable, which in turn can be associated with its macroscopic or microscopic character. We show that, under general assumptions and on average over all states, imperfect devices are able to reproduce the dynamics of macroscopic observables accurately, while the relative error in the expectation value of microscopic observables is much larger on average. We experimentally demonstrate the universality of these features in a state-of-the-art quantum simulator and show that the predicted behavior is generic for a highly accurate device, without assuming any knowledge about the nature of the imperfections.

quant-ph↗

arXiv2020

Small, Highly Accurate Quantum Processor for Intermediate-Depth Quantum Simulations

Analog quantum simulation is widely considered a step on the path to fault tolerant quantum computation. If based on current noisy hardware, the accuracy of an analog simulator will degrade after just a few time steps, especially when simulating complex systems that are likely to exhibit quantum chaos. Here we describe a small, highly accurate quantum simulator and its use to run high fidelity simulations of three different model Hamiltonians for $>100$ time steps. While not scalable to exponentially large Hilbert spaces, this platform provides the accuracy and programmability required for systematic exploration of the interplay between dynamics, imperfections, and accuracy in quantum simulation.

quant-ph↗