B.M. Terhal
102 records found
1
Neural network decoders can achieve a lower logical error rate compared to conventional decoders, like minimum-weight perfect matching, when decoding the surface code. Furthermore, these decoders require no prior information about the physical error rates, making them highly adap
...
In reference Bravyi et al., [Nature (London) 627, 778 (2024)NATUAS0028-083610.1038/s41586-024-07107-7], Bravyi et al. found examples of bivariate bicycle (BB) codes with similar logical performance to the surface code but with an improved encoding rate. In this work, we generaliz
...
One of the main problems in computational physics is predicting the low-energy behavior of many-body quantum systems. The computational complexity of this problem, however, is relatively poorly understood. A recent major progress in this direction has been the no low-energy trivi
...
We formally define homological quantum rotor codes which use multiple quantum rotors to encode logical information. These codes generalize homological or CSS quantum codes for qubits or qudits, as well as linear oscillator codes which encode logical oscillators. Unlike for qubits
...
Quantum error correction allows for quantum information to be preserved using logical qubits, which are subject to lower error rates than their constituent physical qubits. The degree of error suppression depends on the choice of error correcting code and distance, the underlying
...
Small groups of mobile neutral atoms have been manipulated with extraordinary control to form ‘logical’ quantum bits. These qubits can perform quantum computations more reliably than can individual atoms. @en
During the last 30 years, stimulated by the quest to build superconducting quantum processors, a theory of quantum electrical circuits has emerged, which is called circuit quantum electrodynamics or circuit-QED. The goal of the theory is to provide a quantum description of the mo
...
Quantum error correction enables the preservation of logical qubits with a lower logical error rate than the physical error rate, with performance depending on the decoding method. Traditional decoding approaches rely on the binarization ("hardening") of readout data, thereby ign
...
Minimizing leakage from computational states is a challenge when using many-level systems like superconducting quantum circuits as qubits. We realize and extend the quantum-hardware-efficient, all-microwave leakage reduction unit (LRU) for transmons in a circuit QED architecture
...
We consider the problem of approximating the ground state energy of a fermionic Hamiltonian using a Gaussian state. In sharp contrast to the dense case [1, 2], we prove that strictly q-local sparse fermionic Hamiltonians have a constant Gaussian approximation ratio; the result ho
...
The fault-tolerant operation of logical qubits is an important requirement for realizing a universal quantum computer. Spin qubits based on quantum dots have great potential to be scaled to large numbers because of their compatibility with standard semiconductor manufacturing. He
...
We propose and analyze two types of microwave-activated gates between a fluxonium and a transmon qubit, namely a cross-resonance (CR) and a CPHASE gate. The large frequency difference between a transmon and a fluxonium makes the realization of a two-qubit gate challenging. For a
...
Solid-state spin qubits is a promising platform for quantum computation and quantum networks1,2. Recent experiments have demonstrated high-quality control over multi-qubit systems3–8, elementary quantum algorithms8–11 and non-fault-tolerant error
...
Quantum phase estimation is a cornerstone in quantum algorithm design, allowing for the inference of eigenvalues of exponentially-large sparse matrices. The maximum rate at which these eigenvalues may be learned, –known as the Heisenberg limit–, is constrained by bounds on the ci
...
Spectral estimation for Hamiltonians
A comparison between classical imaginary-time evolution and quantum real-time evolution
We consider the task of spectral estimation of local quantum Hamiltonians. The spectral estimation is performed by estimating the oscillation frequencies or decay rates of signals representing the time evolution of states. We present a classical Monte Carlo (MC) scheme which effi
...
We present a Dicke state preparation scheme which uses global control of N spin qubits: our scheme is based on the standard phase estimation algorithm, which estimates the eigenvalue of a unitary operator. The scheme prepares a Dicke state nondeterministically by collectively cou
...
Leakage outside of the qubit computational subspace poses a threatening challenge to quantum error correction (QEC). We propose a scheme using two leakage-reduction units (LRUs) that mitigate these issues for a transmon-based surface code, without requiring an overhead in terms o
...
We analyze whether circuit QED Hamiltonians are stoquastic, focusing on systems of coupled flux qubits. We show that scalable sign-problem-free path integral Monte Carlo simulations can typically be performed for such systems. Despite this, we corroborate the recent finding [I. O
...
Future fault-tolerant quantum computers will require storing and processing quantum data in logical qubits. Here we realize a suite of logical operations on a distance-2 surface code qubit built from seven physical qubits and stabilized using repeated error-detection cycles. Logi
...
Based on numerically optimized real-device gates and parameters we study the performance of the phase-flip (repetition) code on a linear array of gallium arsenide (GaAs) quantum dots hosting singlet-triplet qubits. We first examine the expected performance of the code using simpl
...