Related papers: Tour de gross: A modular quantum computer based on…
We present a new family of quantum low-density parity-check codes, which we call radial codes, obtained from the lifted product of a specific subset of classical quasi-cyclic codes. The codes are defined using a pair of integers $(r,s)$ and…
Recently, usage of detecting regions facilitated the discovery of new circuits for fault-tolerantly implementing the surface code. Building on these ideas, we present LUCI, a framework for constructing fault-tolerant circuits flexible…
The realisation of utility-scale quantum computing inextricably depends on the design of practical, low-overhead fault-tolerant architectures. We introduce the Pinnacle Architecture, which uses quantum low-density parity check (QLDPC) codes…
Experimental realization of stabilizer-based quantum error correction (QEC) codes that would yield superior logical qubit performance is one of the formidable task for state-of-the-art quantum processors. A major obstacle towards realizing…
This paper presents a system for solving binary-valued linear equations using quantum computers. The system is called Mod2VQLS, which stands for Modulo2 Variational Quantum Linear Solver. As far as we know, this is the first such proposal.…
Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competing priorities: minimizing the number of expensive resources,…
One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…
Routed geometry is a device-level choice in a fixed syndrome-extraction circuit. Two embeddings of the same code can set different physical separations between gate blocks active in the same time step, and these separations control the…
The binomial code is renowned for its parity-mediated loss immunity and loss-error recoverability, while geometric phases are widely recognized for their intrinsic resilience against noise. Capitalizing on their complementary merits, we…
Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: There is a basic conflict between nanometre separation desired for qubit-qubit interactions, and…
We investigate the counterparts of random walk in universal quantum computing and their implementation using standard quantum circuits. Quantum walk have been recently well investigated for traversing graphs with certain oracles. We focus…
Quantum computation is a subject of much theoretical promise, but has not been realized in large scale, despite the discovery of fault-tolerant procedures to overcome decoherence. Part of the reason is that the theoretically modest…
The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now is possible to implement short-depth quantum circuits with dozens of qubits and…
Quantum error correcting codes protect quantum computation from errors caused by decoherence and other noise. Here we study the problem of designing logical operations for quantum error correcting codes. We present an automated procedure…
We analyse a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased. The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal…
Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computation. While prior work by Gottesman showed that constant qubit…
We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding…
Topological quantum computation is a promising technique to achieve large-scale, error-corrected computation. Quantum hardware is used to create a large, 3-dimensional lattice of entangled qubits while performing computation requires…
Connecting multiple smaller qubit modules by generating high-fidelity entangled states is a promising path for scaling quantum computing hardware. The performance of such a modular quantum computer is highly dependent on the quality and…
A large class of problems in the current era of quantum devices involve interfacing between the quantum and classical system. These include calibration procedures, characterization routines, and variational algorithms. The control in these…