Related papers: Fault-tolerant fermionic quantum computing
We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes, and topological color codes for error correction. Color codes have a set of transversal…
Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain…
We propose a fault-tolerant quantum computer architecture for trapped-ion devices, which we call the walking cat architecture. Our blueprint includes a compiler, a detailed description of all the quantum error-correction protocols, a…
Topological quantum computing has recently proven itself to be a very powerful model when considering large- scale, fully error corrected quantum architectures. In addition to its robust nature under hardware errors, it is a software driven…
Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties of realizing quantum…
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based…
While the accuracy of qubit operations has been greatly improved in the last decade, further development is demanded to achieve the ultimate goal: a fault-tolerant quantum computer that can solve real-world problems more efficiently than…
A major goal for fault-tolerant quantum computation (FTQC) is to reduce the overhead needed for error correction. One approach is to use block codes that encode multiple qubits, which can achieve significantly higher rates for the same code…
The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation stating that arbitrarily long quantum computations can be performed with a polylogarithmic overhead provided the noise level is below a…
Obtaining high-fidelity and robust quantum gates is the key for scalable quantum computation, and one of the promising ways is to implement quantum gates using geometric phases, where the influence of local noises can be greatly reduced. To…
Quantum simulation of the interactions of fermions and bosons -- the fundamental particles of nature -- is essential for modeling complex quantum systems in material science, chemistry and high-energy physics and has been proposed as a…
We present ffsim, an open-source software library for fast simulation of fermionic quantum circuits. ffsim exploits conservation of particle number and the z component of spin, symmetries present in a wide range of fermionic systems, to…
Fault-tolerant quantum computation using two-dimensional topological quantum error correcting codes can benefit from multi-qubit long-range operations. By using simple commutation rules, a quantum circuit can be transpiled into a sequence…
Local Hamiltonians of fermionic systems on a lattice can be mapped onto local qubit Hamiltonians. Maintaining the locality of the operators comes at the expense of increasing the Hilbert space with auxiliary degrees of freedom. In order to…
We consider a hybrid digital-analog quantum computing approach, which allows implementing any quantum algorithm without standard two-qubit gates. This approach is based on the always-on interaction between qubits, which can provide an…
Holistic resource estimates are essential for guiding the development of fault-tolerant quantum algorithms and the computers they will run on. This is particularly true when we focus on highly-constrained early fault-tolerant devices. Many…
A universal and fault tolerant scheme for quantum computation is proposed which utilizes a class of error correcting codes that is based on the detection of spontaneous emission (of, e.g., photons, phonons, and ripplons). The scheme is…
Quantum computing is one of the most promising technology advances of the latest years. Once only a conceptual idea to solve physics simulations, quantum computation is today a reality, with numerous machines able to execute quantum…
Quantum systems, in general, output data that cannot be simulated efficiently by a classical computer, and hence is useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately,…
Superconducting qubits are one of the most promising candidates to implement quantum computers. The superiority of superconducting quantum computers over any classical device in simulating random but well-determined quantum circuits has…