Quantum computation and quantum error correction: the theoretical minimum

• URL: http://arxiv.org/abs/2602.13876v1
• Date: Sat, 14 Feb 2026 20:29:58 GMT
• Title: Quantum computation and quantum error correction: the theoretical minimum
• Abstract summary: We discuss entanglement and CNOT gates, the Deutsch--Jozsa Problem, and quantum error correction.<n>The necessary background physics of unitary evolution and Born rule measurements is developed as needed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: These notes introduce quantum computation and quantum error correction, emphasising the importance of stabilisers and the mathematical foundations in basic Lie theory. We begin by using the double cover map $\mathrm{SU}_2 \rightarrow \mathrm{SO}_3(\mathbb{R})$ to illustrate the distinction between states and measurements for a single qubit. We then discuss entanglement and CNOT gates, the Deutsch--Jozsa Problem, and finally quantum error correction, using the Steane $[[7,1,3]]$-code as the main example. The necessary background physics of unitary evolution and Born rule measurements is developed as needed. The circuit model is used throughout.

Related papers

• Fine-Grained Unambiguous Measurements [2.5782420501870296]
  We introduce the notion of fine-grained unambiguous measurements.<n>We show that determining the maximal number of parities that a measurement can output can be formulated as a linear program.<n>We discuss the implications of these findings for the Quantum Decoding Problem.
  arXiv  Detail & Related papers  (2025-10-08T17:53:08Z)
• Minimal Equational Theories for Quantum Circuits [44.99833362998488]
  We show that any true equation on quantum circuits can be derived from simple rules. One of our main contributions is to prove the minimality of the equational theory.
  arXiv  Detail & Related papers  (2023-11-13T17:11:25Z)
• Fidelity-based distance bounds for $N$-qubit approximate quantum error correction [0.0]
  Eastin-Knill theorem states that a quantum code cannot correct errors exactly, possess continuous symmetries, and implement a universal set of gates transversely. It is common to employ a complementary measure of fidelity as a way to quantify quantum state distinguishability and benchmark approximations in error correction. We address two distance measures based on the sub- and superfidelities as a way to bound error approximations, which in turn require a lower computational cost.
  arXiv  Detail & Related papers  (2022-12-08T16:10:58Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Quantum algorithms for estimating quantum entropies [6.211541620389987]
  We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state. We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
  arXiv  Detail & Related papers  (2022-03-04T15:44:24Z)
• On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
  The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
  arXiv  Detail & Related papers  (2021-06-11T09:43:09Z)
• Quantum error correction and large $N$ [0.0]
  We study the error correcting properties of the fermionic sector of various large $N$ theories. We argue that gauge singlet states indeed form a quantum error correcting code.
  arXiv  Detail & Related papers  (2020-08-28T22:21:20Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• Optimal Universal Quantum Error Correction via Bounded Reference Frames [8.572932528739283]
  Error correcting codes with a universal set of gates are a desideratum for quantum computing. We show that our approximate codes are capable of efficiently correcting different types of erasure errors. Our approach has implications for fault-tolerant quantum computing, reference frame error correction, and the AdS-CFT duality.
  arXiv  Detail & Related papers  (2020-07-17T18:00:03Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
  We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
  arXiv  Detail & Related papers  (2020-02-21T16:15:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.