Related papers: Quantum Locally Testable Code with Constant Soundn…
$ \newcommand{\Xlin}{\mathcal{X}} \newcommand{\Zlin}{\mathcal{Z}} \newcommand{\C}{\mathbb{C}} $We give a quantum multiprover interactive proof system for the local Hamiltonian problem in which there is a constant number of provers,…
A locally decodable code (LDC) $C \colon \{0,1\}^k \to \{0,1\}^n$ is an error-correcting code that allows one to recover any bit of the original message with good probability while only reading a small number of bits from a corrupted…
Quantum entanglement is considered, by and large, to be a very delicate and non-robust phenomenon that is very hard to maintain in the presence of noise, or non-zero temperatures. In recent years however, and motivated, in part, by a quest…
Quantum computing has attracted a lot of attention in recent years. It is one of the promising candidates for the next-generation computing paradigms. Basically, there are two technical lines to realize quantum computing. One is composing…
Entanglement allows for the nonlocality of quantum theory, which is the resource behind device-independent quantum information protocols. However, not all entangled quantum states display nonlocality, and a central question is to determine…
To build a fault-tolerant quantum computer, it is necessary to implement a quantum error correcting code. Such codes rely on the ability to extract information about the quantum error syndrome while not destroying the quantum information…
We suggest several techniques to improve the toric codes and the finite-rate generalized toric codes (quantum hypergraph-product codes) recently introduced by Tillich and Z\'emor. For the usual toric codes, we introduce the rotated lattices…
Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…
We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter r which estimates the scale-up in the size of the circuit due…
Non-local quantum computation (NLQC) replaces a local interaction between two systems with a single round of communication and shared entanglement. Despite many partial results, it is known that a characterization of entanglement cost in at…
Non-locality consists in the existence of non-classical correlations between local measurements. So far, it has been investigated mostly in isolated quantum systems. Here we show that non-local correlations are present, can be detected and…
The ability of a quantum computer to reproduce or replicate the results of a quantum circuit is a key concern for verifying and validating applications of quantum computing. Statistical variations in circuit outcomes that arise from…
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…
Fault-tolerant quantum computation using lattice surgery can be abstracted as operations on graphs, wherein each logical qubit corresponds to a vertex of the graph, and multi-qubit measurements are accomplished by connecting the vertices…
The onset of the era of fully-programmable error-corrected quantum computers will be marked by major breakthroughs in all areas of science and engineering. These devices promise to have significant technological and societal impact, notable…
The Quantum Lov\'asz Local Lemma (QLLL) [AKS12] establishes non-constructively that any quantum system constrained by a local Hamiltonian has a zero-energy ground state, if the local Hamiltonian terms overlap only in a certain restricted…
Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations come with distance-dependent temporal overheads. We…
We develop a topological theory for fault-tolerant quantum computation in quantum low-density parity-check (qLDPC) codes. We show that there exist hidden simplicial or CW complex structures encoding the topological data for all qLDPC and…
Recent experiments indicate a connection between the low- and high-frequency noise affecting superconducting quantum systems. We explore the possibilities that both noises can be produced by one ensemble of microscopic modes, made up, e.g.,…
We study approximate quantum low-density parity-check (QLDPC) codes, which are approximate quantum error-correcting codes specified as the ground space of a frustration-free local Hamiltonian, whose terms do not necessarily commute. Such…