Related papers: Efficiently constructing a quantum uniform superpo…
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…
Following hep-th/0001204 we discuss the computation of quantum corrections near long IIB superstring configurations in AdS_5 x S^5 which are related to the Wilson loop expectation values in the strong coupling expansion of the dual n=4 SYM…
The theory of quantum algorithms promises unprecedented benefits of harnessing the laws of quantum mechanics for solving certain computational problems. A persistent obstacle to using such algorithms for solving a wide range of real-world…
We propose a practical, scalable, and efficient scheme for quantum computation using spatially separated matter qubits and single photon interference effects. The qubit systems can be NV-centers in diamond, Pauli-blockade quantum dots with…
Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called surface codes. We study the problem of compiling quantum…
We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to…
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from…
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit…
The characterization of high-dimensional entanglement plays a crucial role in the field of quantum information science. Conventional entanglement criteria measuring coherent superpositions of multiple basis states face experimental…
Quantum computers hold promise to enable efficient simulations of the properties of molecules and materials; however, at present they only permit ab initio calculations of a few atoms, due to a limited number of qubits. In order to harness…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also…
We consider two distant spin-$\frac{1}{2}$ particles (or qubits) and a number of interacting objects, all with the same value $S\gg1$ of their respective spin, distributed on a one-dimensional lattice (or large-$S$ spin chain). The quantum…
We consider a spatial analogue of the quantum error correction threshold. Given individual time-independent subsystems in which quantum information is coherent over sufficiently long lengths, we show how the information can be kept coherent…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…
Gottesman-Kitaev-Preskill (GKP) encoding holds promise for continuous-variable fault-tolerant quantum computing. While an ideal GKP encoding is abstract and impractical due to its nonphysical nature, approximate versions provide viable…
Quantum error correction is an important ingredient for scalable quantum computing. Stabilizer codes are one of the most promising and straightforward ways to correct quantum errors, are convenient for logical operations, and improve…
Quantum communication is at the forefront of quantum technology, enabling the development of absolutely secure encryption, distributed quantum computing, teleportation and more. Whilst quantum communication has been experimentally…
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Berta-Borderi-Fawzi-Scholz, Mathematical Programming, 2021]…
In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower…