Quantum computing and quadratically signed weight enumerators

DOI10.1016/S0020-0190(00)00222-2zbMath1032.68080WikidataQ126758793 ScholiaQ126758793MaRDI QIDQ1603471

Raymond Laflamme, Emanuel Knill

Publication date: 14 July 2002

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

zbMATH Keywords

Computational complexityQuantum computingCombinatorial problemsTheory of computing

Mathematics Subject Classification ID

Related Items (20)

Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit ⋮ Parallel computational structure of noisy quantum circuits simulation ⋮ Some properties of generalized quantum operations ⋮ Nuclear numerical range and quantum error correction codes for non-unitary noise models ⋮ Commuting quantum circuits and complexity of Ising partition functions ⋮ Problem of quantifying quantum correlations with non-commutative discord ⋮ Tripartite and bipartite quantum correlations in the XXZ spin chain with three-site interaction ⋮ Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ ⋮ Unnamed Item ⋮ Classical Ising model test for quantum circuits ⋮ Structure of 2D topological stabilizer codes ⋮ Quantum computation in quantum-Hall systems. ⋮ A Hamiltonian for quantum copying ⋮ QUANTUM DISCORD AND QUANTUM COMPUTING — AN APPRAISAL ⋮ 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 ⋮ An entropic analysis of approximate quantum error correction ⋮ Suppressing phase damping decoherence by periodical imperfect projective measurements ⋮ A new connection between quantum circuits, graphs and the Ising partition function ⋮ Sumcheck-based delegation of quantum computing to rational server

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Promise problems complete for complexity classes
• Time/Space Trade-Offs for Reversible Computation
• Quantum computations: algorithms and error correction
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computability
• Quantum Complexity Theory

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