scientific article; zbMATH DE number 7378375

DOI10.4230/LIPIcs.MFCS.2018.58MaRDI QIDQ5005160

Aarthi Sundaram, Miklos Santha, Sevag Gharibian, Jamie Sikora, Justin Yirka

Publication date: 4 August 2021

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

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

zbMATH Keywords

semidefinite programmingquantum computingpolynomial hierarchycomplexity theoryquantum complexityQMA (2)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Front Matter, Table of Contents, Preface, Conference Organization ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quantum characterization of NP
• Quantum Arthur-Merlin games
• NP is as easy as detecting unique solutions
• Complete sets and the polynomial-time hierarchy
• Geometric algorithms and combinatorial optimization.
• An oracle builder's toolkit
• Complexity limitations on quantum computation
• A note on the circuit complexity of PP
• Hardness of Approximation for Quantum Problems
• Proceedings of the forty-second ACM symposium on Theory of computing
• A Full Characterization of Quantum Advice
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• PP is as Hard as the Polynomial-Time Hierarchy
• Algebraic methods for interactive proof systems

This page was built for publication: