The Heisenberg representation of quantum computers
From MaRDI portal
Publication:2736498
zbMATH Open0977.81005arXivquant-ph/9807006MaRDI QIDQ2736498FDOQ2736498
Publication date: 10 September 2001
Full work available at URL: https://arxiv.org/abs/quant-ph/9807006
Recommendations
Cited In (58)
- A separable, dynamically local ontological model of quantum mechanics
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation
- Quantum Fault Tolerance in Systems with Restricted Control
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Complexity growth and the Krylov-Wigner function
- Dynamics of atomic magic in the Jaynes-Cummings model
- Classical simulation of quantum circuits by half Gauss sums
- Detecting magic states via characteristic functions
- Irreversibility and entanglement spectrum statistics in quantum circuits
- Nonlocality and information flow: the approach of Deutsch and Hayden
- Topological quantum memory
- Title not available (Why is that?)
- A scheme for realizing a distant two-qubit controlled-U gate with nearest qubit-qubit interaction
- Title not available (Why is that?)
- Topological quantum error correction in the Kitaev honeycomb model
- Quantum chaos and circuit parameter optimization
- A quantum computer only needs one universe
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Knots, links, and long-range magic
- Two-round quantum homomorphic encryption scheme based on matrix decomposition
- Exponential decay of correlations implies area law
- Transforming graph states using single-qubit operations
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- The quantum density matrix and its many uses. From quantum structure to quantum chaos and noisy simulators
- Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations
- Unifying typical entanglement and coin tossing: on randomization in probabilistic theories
- Clifford gates in the Holant framework
- Mathematical etudes on quantum computation
- Graphical CSS Code Transformation Using ZX Calculus
- A new protocol for constructing nonlocal \(n\)-qubit controlled-\(U\) gates
- Secure multiparty quantum secret sharing with the collective eavesdropping-check character
- What is quantum information?
- Can a Quantum Computer Run the von Neumann Architecture?
- Constructions for quantum indistinguishability obfuscation
- Quantum computation of phase transition in interacting scalar quantum field theory
- Correlation measures and the entanglement wedge cross-section after quantum quenches in two-dimensional conformal field theories
- A one-way quantum amplifier for long-distance quantum communication
- Dual-code quantum computation model
- How to efficiently select an arbitrary Clifford group element
- Lattice surgery translation for quantum computation
- On the satisfiability of quantum circuits of small treewidth
- Title not available (Why is that?)
- The discrete center-of-mass tomogram
- The decomposition of an arbitrary \(2^w \times 2^w\) unitary matrix into signed permutation matrices
- A Fully Fault-Tolerant Representation of Quantum Circuits
- Title not available (Why is that?)
- On the Satisfiability of Quantum Circuits of Small Treewidth
- Title not available (Why is that?)
- From the Bloch Sphere to Phase-Space Representations with the Gottesman–Kitaev–Preskill Encoding
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
- Error-correcting codes for fermionic quantum simulation
- Quantifying non-stabilizerness via information scrambling
- Topological defects in Floquet circuits
- On classical simulation of quantum circuits composed of Clifford gates
- Gottesman types for quantum programs
- Wigner's theorem for stabilizer states and quantum designs
- A mathematical model for representing the related operator professional activities and their diagnostic assessments based on the quantum representations
- Zero-knowledge proof systems for QMA
This page was built for publication: The Heisenberg representation of quantum computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736498)
