Related papers: Geometrically Enhanced Topological Quantum Codes
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes,…
We introduce new rounding methods to improve the accuracy of finite precision quantum arithmetic. These quantum rounding methods are applicable when multiple samples are being taken from a quantum program. We show how to use multiple…
Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum error correcting codes. Codes of distance 2…
Engineering synthetic dimensions, where the physics of additional spatial dimensions is simulated within the internal states of a quantum system, allows the realisation of phenomena not otherwise accessible in experiments. Ultracold…
We study variants of Shor's code that are adept at handling single-axis correlated idling errors, which are commonly observed in many quantum systems. By using the repetition code structure of the Shor's code basis states, we calculate the…
Entangled resources enable quantum sensing that achieves Heisenberg scaling, a quadratic improvement on the standard quantum limit, but preparing large scale entangled states is challenging in the presence of decoherence. We present a…
Bosonic systems offer unique advantages for quantum error correction, as a single bosonic mode provides a large Hilbert space to redundantly encode quantum information. However, previous studies have been limited to exploiting symmetries in…
Hybridizing different physical systems or degrees of freedom offers significant advantages for realizing practical, universal, scalable, and fault-tolerant quantum computation (FTQC). Here, we propose optical FTQC schemes with low squeezing…
Quantum computers are predicted to utilize quantum states to perform memory and to process tasks far faster than those of conventional classical computers. In this paper we show a new road towards building fault tolerance quantum computer…
An algorithm which encodes the $L\times L$ 2D toric code logical state with a circuit of depth $2L+1$, using only local controlled-NOT($CX$) and Hadamard($H$) gates, is presented.
Quantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been discovered which require a high degree of spatial…
We demonstrate that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We provide an explicit recipe to construct unitaries and associated…
Topological subsystem codes in three spatial dimensions allow for quantum error correction with no time overhead, even in the presence of measurement noise. The physical origins of this single-shot property remain elusive, in part due to…
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…
Is the notion of a quantum computer resilient to thermal noise unphysical? We address this question from a constructive perspective and show that local quantum Hamiltonian models provide self-correcting quantum computers. To this end, we…
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…
We investigate stabilizer codes with carrier qudits of equal dimension $D$, an arbitrary integer greater than 1. We prove that there is a direct relation between the dimension of a qudit stabilizer code and the size of its corresponding…
Topological quantum error correcting codes have emerged as leading candidates towards the goal of achieving large-scale fault-tolerant quantum computers. However, quantifying entanglement in these systems of large size in the presence of…
Quantum state preparation is a crucial process within numerous quantum algorithms, and the need for efficient initialization of quantum registers is ever increasing as demand for useful quantum computing grows. The problem arises as the…
We propose a scheme for quantum computing using high-Q cavities in which the qubits are represented by single cavity modes restricted in the space spanned by the two lowest Fock states. We show that single qubit operations and universal…