Quasi-exact quantum computation

  title={Quasi-exact quantum computation},
  author={Dong-Sheng Wang and Guanyu Zhu and Cihan Okay and Raymond Laflamme},
  journal={arXiv: Quantum Physics},
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 exact codes, serving as its fixed points. We find that the incompatibility between universality and transversality of the set of quantum gates does not persist in the quasi-exact scenario. A class of covariant quasi-exact codes is defined which proves to… 
A comparative study of universal quantum computing models: towards a physical unification
  • D.-S. Wang
  • Computer Science, Physics
    Quantum Eng.
  • 2021
This work carried out a primary attempt to unify UQCM by classifying a few of them as two categories, hence making a table of models, which reveals the importance and feasibility of systematic study of computing models.
Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
This work develops quasi error-correction theory using quantum instrument, the notions of quasi universality, quasi code distances, and quasi thresholds, etc, and finds a wide class of quasi codes which are called valence-bond-solid codes, and uses them as concrete examples to demonstrate QEQ computation.
Near-Optimal Covariant Quantum Error-Correcting Codes from Random Unitaries with Symmetries
The results not only indicate (potentially efficient) randomized constructions of optimal U (1)- and SU ( d )-covariant codes, but also reveal fundamental properties of random symmetric unitaries, which yield important solvable models of complex quantum systems that have attracted great recent interest in quantum gravity and condensed matter physics.
Optimal universal quantum error correction via bounded reference frames
Yuxiang Yang,1, 2 Yin Mo,2 Joseph M. Renes,1 Giulio Chiribella,2, 3, 4, 5 and Mischa P. Woods1 Institute for Theoretical Physics, ETH Zürich, Switzerland QICI Quantum Information and Computation
A prototypical model of universal quantum computer system
A model of universal quantum computer system, the quantum version of the von Neumann architecture is proposed, which demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems in the near future.
New perspectives on covariant quantum error correction
New and powerful lower bounds on the infidelity of covariant quantum error correction are proved, which not only extend the scope of previous no-go results but also provide a substantial improvement over existing bounds.
Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies
Borders on symmetry violation indicate limitations on the precision or density of transversally implementable logical gates for general QEC codes, refining the Eastin–Knill theorem and nontrivial approximately covariant codes.
Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem.
We present a simple proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code (QECC) with its ability to achieve a universal set of transversal
Error Correction of Quantum Reference Frame Information
A no-go theorem is proved showing that that no finite dimensional, group-covariant quantum codes exist for Lie groups with an infinitesimal generator, and it is demonstrated that all finite groups have finite dimensional codes.


Restrictions on transversal encoded quantum gate sets.
It is shown that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.
Valence bond solids for SU(n) spin chains: Exact models, spinon confinement, and the Haldane gap
To begin with, we introduce several exact models for SU(3) spin chains: First is a translationally invariant parent Hamiltonian involving four-site interactions for the trimer chain, with a threefold
Continuous Symmetries and Approximate Quantum Error Correction
The approach provides insight into how time evolution in the bulk corresponds to time evolution on the boundary without violating the Eastin-Knill theorem, and the five-rotor code can be stacked to form a covariant holographic code.
The Solovay-Kitaev algorithm
The algorithm can be used to compile Shor's algorithm into an efficient fault-tolerant form using only Hadamard, controlled-not, and π/8 gates, and is generalized to apply to multi-qubit gates and togates from SU(d).
Iterative optimization of quantum error correcting codes.
We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be
Theory of quantum error-correcting codes
A general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions is developed and necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction are obtained.
Classes of topological qubits from low-dimensional quantum spin systems
Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
There is a direct relationship between how small this error can be and how accurate quantum clocks can be: the more accurate the clock, the smaller the error; and the no-go theorem would be violated if time could be measured perfectly in quantum mechanics.
Instantaneous braids and Dehn twists in topologically ordered states
This work shows that braids and Dehn twists can in general be implemented by a constant depth quantum circuit, with a depth that is independent of code distance and system size, and demonstrates how universal logical gate sets can be implemented on encoded qubits using only constant depth unitary circuits.
Quantum origami: Transversal gates for quantum computation and measurement of topological order
It is demonstrated that multi-layer topological states with appropriate boundary conditions and twist defects allow modular transformations to be effectively implemented by a finite sequence of local SWAP gates between the layers, and methods to directly measure the modular matrices, and thus the fractional statistics of anyonic excitations are provided, providing a novel way to directlyMeasure topological order.