arXiv subjects

Selwyn Simsek

Publications and source records attributed to Selwyn Simsek.

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↗

arXiv2023

Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code

Fault-tolerant operations based on stabilizer codes are the state of the art in suppressing error rates in quantum computations. Most such codes do not permit a straightforward implementation of non-Clifford logical operations, which are necessary to define a universal gate set. As a result, implementations of these operations must either use error-correcting codes with more complicated error correction procedures or gate teleportation and magic states, which are prepared at the logical level, increasing overhead to a degree that precludes near-term implementation. In this work, we implement a small quantum algorithm, one-qubit addition, fault-tolerantly on the Quantinuum H1-1 quantum computer, using the [[8,3,2]] colour code. By removing unnecessary error-correction circuits and using low-overhead techniques for fault-tolerant preparation and measurement, we reduce the number of error-prone two-qubit gates and measurements to 36. We observe arithmetic errors with a rate of $\sim 1.1 \times 10^{-3}$ for the fault-tolerant circuit and $\sim 9.5 \times 10^{-3}$ for the unencoded circuit.

quant-ph↗

arXiv2022

Optimal control with a multidimensional quantum invariant

Optimal quantum control of continuous variable systems poses a formidable computational challenge because of the high-dimensional character of the system dynamics. The framework of quantum invariants can significantly reduce the complexity of such problems, but it requires the knowledge of an invariant compatible with the Hamiltonian of the system in question. We explore the potential of a Gaussian invariant that is suitable for quadratic Hamiltonians with any given number of motional degrees of freedom for quantum optimal control problems that are inspired by current challenges in ground-state-to-ground-state shuttling of trapped-ions.

quant-ph↗

arXiv2021

Quantum invariant-based control of interacting trapped ions

Invariant-based inverse engineering is an elegant approach to quantum control with corresponding experimental implementations that perform tasks with applications in quantum information processing such as shuttling trapped ions. We build on recent work to generalise invariant-based inverse engineering to control two coupled harmonic oscillators in any number of spatial dimensions. This may be used to perform experimentally relevant tasks such as separation of trapped ions, which is demonstrated numerically, achieving transfer fidelities of over 96% as well as low motional number excitations.

quant-ph↗

arXiv2021

Quantum control with a multi-dimensional Gaussian quantum invariant

The framework of quantum invariants is an elegant generalization of adiabatic quantum control to control fields that do not need to change slowly. Due to the unavailability of invariants for systems with more than one spatial dimension, the benefits of this framework have not yet been exploited in multi-dimensional systems. We construct a multi-dimensional Gaussian quantum invariant that permits the design of time-dependent potentials that let the ground state of an initial potential evolve towards the ground state of a final potential. The scope of this framework is demonstrated with the task of shuttling an ion around a corner which is a paradigmatic control problem in achieving scalability of trapped ion quantum information technology.

quant-ph↗

arXiv2020

Quantum Delocalised-Interactions

Classical mechanics obeys the intuitive logic that a physical event happens at a definite spatial point. Entanglement however, breaks this logic by enabling interactions without a specific location. In this work we study these delocalised-interactions. These are quantum interactions that create less locational information than would be possible classically, as captured by the disturbance induced on some spatial superposition state. We introduce quantum games to capture the effect and demonstrate a direct operational use for quantum concurrence in that it bounds the non-classical performance gain. We also find a connection with quantum teleportation, and demonstrate the games using an IBM quantum processor.

quant-ph↗