Polynomial time quantum computation with advice
From MaRDI portal
Publication:2390250
Abstract: Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the behaviors of an underlying polynomial-time quantum computation with bounded-error probability.
Recommendations
Cites work
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
- Circuit-size lower bounds and non-reducibility to sparse sets
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Computational Work and Time on Finite Machines
- Cryptocomplexity and NP-completeness
- Dense quantum coding and quantum finite automata
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1418357 (Why is no real title available?)
- scientific article; zbMATH DE number 1418967 (Why is no real title available?)
- Local transition functions of quantum Turing machines
- On helping by robust oracle machines
- On Isomorphisms and Density of NP and Other Complete Sets
- Quantum Complexity Theory
- Quantum Computability
- Quantum computational networks
- Quantum computations: algorithms and error correction
- Quantum theory, the Church–Turing principle and the universal quantum computer
- The structure of logarithmic advice complexity classes
- Turing machines that take advice
Cited in
(16)- An application of quantum finite automata to interactive proof systems
- Amount of nonconstructivity in deterministic finite automata
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report)
- Constant-space quantum interactive proofs against multiple provers
- A full characterization of quantum advice
- Multiple usage of random bits in finite automata
- Amount of Nonconstructivity in Finite Automata
- Shadow tomography of quantum states
- Quantum state complexity of formal languages
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- How does adiabatic quantum computation fit into quantum automata theory?
- Classical vs quantum advice and proofs under classically-accessible oracle
- A qubit, a coin, and an advice string walk into a relational problem
- Quantum polynomial hierarchies: Karp-Lipton, error reduction, and lower bounds
- Uncloneable quantum advice
- Quantum information and the PCP theorem
This page was built for publication: Polynomial time quantum computation with advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390250)
