7486 search results - page 23 / 1498 » The Limits of Quantum Computers |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
STACS
2000
Springer
14 years 8 days ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
DAGSTUHL
2007
13 years 10 months ago
2007
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
ICCS
2004
Springer
14 years 2 months ago
2004
Springer
Theoretical modeling of chemical and biological processes is a key to understand nature and to predict experiments. Unfortunately, this is very data and computation extensive. Howe...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present a method for verifying measurement-based quantum computations, by producing a quantum circuit equivalent to a given deterministic measurement pattern. We defin...