508 search results - page 34 / 102 » Poly-locality in quantum computing |
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
IPL
2000
13 years 8 months ago
2000
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Adiabatic quantum annealing is a paradigm of analog quantum computation, where a given computational job is converted to the task of finding the global minimum of some classical po...
FUNGAMES
2008
13 years 9 months ago
2008
Recent developments in computer science introduce and discuss new concepts for computation beyond universal Turing machines. Quantum computing relates to new insights in quantum ph...
FOCS
2008
IEEE
13 years 9 months ago
2008
IEEE
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...