Sciweavers

508 search results - page 16 / 102
» Poly-locality in quantum computing
Sort
View
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 2 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
UC
2007
Springer
14 years 2 months ago
Taming Non-compositionality Using New Binders
We propose an extension of the traditional λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new bind...
Frédéric Prost
ITNG
2007
IEEE
14 years 2 months ago
Computational Power of the Quantum Turing Automata
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
CPHYSICS
2007
71views more  CPHYSICS 2007»
13 years 8 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
CISS
2007
IEEE
13 years 10 months ago
Quantum Switching Networks with Classical Routing
— Flexible distribution of data in the form of quantum bits (qubits) amongst spatially separated entities is an essential component of envisioned scalable quantum computing archi...
Rahul Ratan, Manish Kumar Shukla, A. Yavuz Oru&cce...