Quantum Complexity Theory
From MaRDI portal
Publication:4376183
DOI10.1137/S0097539796300921zbMATH Open0895.68042DBLPjournals/siamcomp/BernsteinV97WikidataQ55878430 ScholiaQ55878430MaRDI QIDQ4376183FDOQ4376183
Authors: Ethan Bernstein, Umesh V. Vazirani 
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
reversibilityquantum computationquantum Turing machinesFourier samplingquantum polynomial timeuniversal quantum Turing machine
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Cited In (only showing first 100 items - show all)
- Machine semantics
- Quantum circuit oracles for abstract machine computations
- Succinct classical verification of quantum computation
- Title not available (Why is that?)
- Approximation and universality of fuzzy Turing machines
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- Quantum algorithm to solve function inversion with time-space trade-off
- Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
- A probabilistic model of computing with words
- Approximation of fuzzy context-free grammars
- Unbounded-error quantum query complexity
- The quantum setting with randomized queries for continuous problems
- Quantum counterfeit coin problems
- Remarks on universal quantum computer
- Quantum principles and mathematical computability
- Models of quantum computation and quantum programming languages
- Quantum image processing?
- Simulating fermions on a quantum computer
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- Quantum computation and quantum information†
- Quantum information cannot be split into complementary parts
- Resource restricted computability theoretic learning: Illustrative topics and problems
- Quantum algorithm for SAT problem andquantum mutual entropy
- Some algebraic properties of measure-once two-way quantum finite automata
- An oracle builder's toolkit
- Efficient quantum algorithms of finding the roots of a polynomial function
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- On Halting Process of Quantum Turing Machine
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- Space-bounded quantum complexity
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Fast and scalable quantum computing simulation on multi-core and many-core platforms
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- A new connection between quantum circuits, graphs and the Ising partition function
- DELETING A MARKED BASIS-STATE FROM AN EVEN SUPERPOSITION OF ALL BASIS-STATES WITH A SINGLE QUERY
- The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries
- Uniformity of quantum circuit families for error-free algorithms
- One complexity theorist's view of quantum computing
- On the computational power of bounded error quantum Turing machines
- Physical quantum algorithms
- Quantum implicit computational complexity
- Quantum lower bounds for the Goldreich-Levin problem
- Computing power of Turing machines in the framework of unsharp quantum logic
- Generality's price: Inescapable deficiencies in machine-learned programs
- The complexity of translationally invariant low-dimensional spin lattices in 3D
- Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits
- Quantum protocols for untrusted computations
- Local transition functions of quantum Turing machines
- Title not available (Why is that?)
- Realizable Hamiltonians for universal adiabatic quantum computers
- Quantum Kolmogorov complexity and information-disturbance theorem
- Improved bounds on quantum learning algorithms
- Some remarks on quantum automata
- ``quantumness versus ``classicality of quantum states and quantum protocols
- Quantum algorithmic randomness
- Analogies and differences between quantum and stochastic automata
- Quantum loop programs
- On the impossibility of interaction-free quantum sensing for small I/O bandwidth
- Blind quantum machine learning based on quantum circuit model
- Mathematical models of quantum computation
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- Martin-Löf random quantum states
- Complexity of operators generated by quantum mechanical Hamiltonians
- Simplified proof of the Fourier sampling theorem
- Quantum algorithm design: techniques and applications
- A full characterization of quantum advice
- Universality of quantum Turing machines with deterministic control
- An exact quantum algorithm for the 2-junta problem
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- Temporally unstructured quantum computation
- Classical simulation complexity of quantum machines.
- Quantum algorithm for determining a complex number string
- On a measurement-free quantum lambda calculus with classical control
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
- Quantum algorithm for the root-finding problem
- Kochen-Specker theorem as a precondition for quantum computing
- Hypercomputation with quantum adiabatic processes
- Computational Complexity of Quantum Satisfiability
- Almost-everywhere superiority for quantum polynomial time
- Creating very true quantum algorithms for quantum energy based computing
- Measurement-Based and Universal Blind Quantum Computation
- The space ``just above BQP
- Prefix-free quantum Kolmogorov complexity
- Quantum and classical complexity classes: Separations, collapses, and closure properties
- An introduction to quantum annealing
- Human rationality challenges universal logic
- Nonadaptive quantum query complexity
- An introduction to quantum computing, without the physics
- Efficient quantum algorithm for the parity problem of a certain function
- Quantum machine learning: a classical perspective
- Quantum Hamiltonian Complexity
- An improved lower bound on query complexity for quantum PAC learning
- Title not available (Why is that?)
- Quantum arithmetic with the quantum Fourier transform
- The complexity of translationally invariant spin chains with low local dimension
- Architecture of a deterministic quantum central processing unit
- Towards quantum computing based community detection
This page was built for publication: Quantum Complexity Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376183)
