scientific article; zbMATH DE number 7250161

DOI10.4230/LIPIcs.CCC.2018.21zbMath1441.81054arXiv1709.01805MaRDI QIDQ5121909

Joseph Fitzsimons, Dax Enshan Koh, Adam Bouland

Publication date: 22 September 2020

Full work available at URL: https://arxiv.org/abs/1709.01805

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial hierarchysampling problemsquantum advantagegate-set classification

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (2)

Classically simulating quantum circuits with local depolarizing noise ⋮ Unnamed Item

Uses Software

• QuaEC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-dual codes and invariant theory
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Multiple-particle interference and quantum error correction
• PP is as Hard as the Polynomial-Time Hierarchy
• Matchgates and classical simulation of quantum circuits
• On the Structure of Polynomial Time Reducibility
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Complexity classification of two-qubit commuting Hamiltonians
• The computational complexity of linear optics
• Quantum computing, postselection, and probabilistic polynomial-time
• The invariants of the Clifford groups

This page was built for publication: