Related papers: Fault Tolerant Quantum Simulation via Symplectic T…
Transversal gates are the ideal gates in a fault-tolerant scenario; relatively easy to implement, and minimally error propagating. Their availability will maximise fault tolerant thresholds, enabling universal quantum computation in a wider…
Recent years have seen unprecedented advance in the design and control of quantum computers. Nonetheless, their applicability is still restricted and access remains expensive. Therefore, a substantial amount of quantum algorithms research…
Although qubit coherence times and gate fidelities are continuously improving, logical encoding is essential to achieve fault tolerance in quantum computing. In most encoding schemes, correcting or tracking errors throughout the computation…
Understanding the dynamics of quantum systems is crucial in many areas of physics, but simulating many-body systems presents significant challenges due to the large Hilbert space to navigate and the exponential growth of computational…
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…
We show that universal holonomic quantum computation (HQC) can be achieved fault-tolerantly by adiabatically deforming the gapped stabilizer Hamiltonian of the surface code, where quantum information is encoded in the degenerate ground…
Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles such as inevitable physical errors and the limited…
The threshold theorem promises a path to fault-tolerant quantum computation, provided the physical error rate is below a critical threshold. While transversal gates efficiently implement logical operations, they propagate errors and can…
Simulation of quantum many-body systems is a promising application of quantum computers. However, implementing the time-evolution operator as a quantum circuit efficiently on near-term devices with limited resources is challenging. Standard…
Quantum computers promise to solve problems that are intractable for classical computers, but qubits are vulnerable to many sources of error, limiting the depth of the circuits that can be reliably executed on today's quantum hardware.…
We simulate the implementation of a T-gate, or $\frac{\pi}{8}$-gate, for a [7,1,3] encoded logical qubit in a non-equiprobable error environment. We demonstrate that the use of certain non-fault tolerant methods in the implementation may…
The conventional circuit paradigm, utilizing a limited number of gates to construct arbitrary quantum circuits, is hindered by significant noise overhead. For instance, the standard gate paradigm employs two CNOT gates for the partial…
Recent advances in quantum error-correction (QEC) have shown that it is often beneficial to understand fault-tolerance as a dynamical process, a circuit with redundant measurements that help correct errors, rather than as a static code…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
Quantum holonomic gates hold built-in resilience to local noises and provide a promising approach for implementing fault-tolerant quantum computation. We propose to realize high-fidelity holonomic $(N+1)$-qubit controlled gates using…
We develop a scheme for fault-tolerant quantum computation based on asymmetric Bacon-Shor codes, which works effectively against highly biased noise dominated by dephasing. We find the optimal Bacon-Shor block size as a function of the…
Experiments conducted on open-access cloud-based IBM Quantum devices are presented for characterizing their fault tolerance using $[4,2,2]$-encoded gate sequences. Up to 100 logical gates are activated in the IBMQ Bogota and IBMQ Santiago…
Understanding the impact of gate errors on quantum circuits is crucial to determining the potential applications of quantum computers, especially in the absence of large-scale error-corrected hardware. We put forward analytical arguments,…
Quantum computers are expected to bring drastic acceleration to several computing tasks against classical computers. Noisy intermediate-scale quantum (NISQ) devices, which have tens to hundreds of noisy physical qubits, are gradually…
Simulation of continuous time evolution requires time discretization on both classical and quantum computers. A finer time step improves simulation precision, but it inevitably leads to increased computational efforts. This is particularly…