Quantum computing and quadratically signed weight enumerators

DOI10.1016/S0020-0190(00)00222-2MaRDI QIDQ1603471zbMATH OpenWikidataFDO

Authors Emanuel Knill, Raymond Laflamme

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(00)00222-2

zbMATH Keywords

Combinatorial problemsComputational complexityQuantum computingTheory of computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Strengths and Weaknesses of Quantum Computing
• Quantum Computability
• scientific article; zbMATH DE number 5320307
• scientific article; zbMATH DE number 1796836
• Quantum computing, postselection, and probabilistic polynomial-time

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 512802 (Why is no real title available?)
• scientific article; zbMATH DE number 1559533 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Promise problems complete for complexity classes
• Quantum Complexity Theory
• Quantum Computability
• Quantum computations: algorithms and error correction
• Time/Space Trade-Offs for Reversible Computation

Cited in

(27)

• A new connection between quantum circuits, graphs and the Ising partition function
• Radix-\(r>2\) quantum computation
• Parallel computational structure of noisy quantum circuits simulation
• Problem of quantifying quantum correlations with non-commutative discord
• Tripartite and bipartite quantum correlations in the XXZ spin chain with three-site interaction
• An entropic analysis of approximate quantum error correction
• Suppressing phase damping decoherence by periodical imperfect projective measurements
• Quantum computation in quantum-Hall systems.
• A Hamiltonian for quantum copying
• Dynamics of quantum correlation of atoms immersed in a thermal quantum scalar fields with a boundary
• Analytic expression of quantum correlations in qutrit Werner states undergoing local and nonlocal unitary operations
• T-count optimized Wallace tree integer multiplier for quantum computing
• Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
• Nuclear numerical range and quantum error correction codes for non-unitary noise models
• Structure of 2D topological stabilizer codes
• Discrete quantum computation and Lagrange's four-square theorem
• Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
• A promiseBQP-complete string rewriting problem
• Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit
• Weighing matrices and optical quantum computing
• Some properties of generalized quantum operations
• Quantum discord and quantum computing -- an appraisal
• Quantum weighted model counting
• Classical Ising model test for quantum circuits
• The quantum complexity of computing Schatten p-norms
• Sumcheck-based delegation of quantum computing to rational server
• Commuting quantum circuits and complexity of Ising partition functions

This page was built for publication: Quantum computing and quadratically signed weight enumerators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603471)