On the solution of trivalent decision problems by quantum state identification
From MaRDI portal
Publication:734207
DOI10.1007/s11047-009-9112-5zbMath1192.68284arXiv0707.1257OpenAlexW2079142595WikidataQ58620619 ScholiaQ58620619MaRDI QIDQ734207
Publication date: 19 October 2009
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.1257
EntanglementQuantum computationGeneralized Deutsch problemQuantum decision problemsQuantum state identificationTrivalent decision problems
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. The theory of functions and sets of natural numbers
- One complexity theorist's view of quantum computing
- Quantum information via state partitions and the context translation principle
- Rapid solution of problems by quantum computation
- Quantum algorithms revisited
- Strengths and Weaknesses of Quantum Computing
- Operationally Invariant Information in Quantum Measurements
- Quantum Computer Science
- Quantum lower bounds by polynomials