Sciweavers

11547 search results - page 27 / 2310
» Quantum computing and communication
Sort
View
141
Voted
CISS
2007
IEEE
15 years 5 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...
111
Voted
ASPDAC
2005
ACM
80views Hardware» more  ASPDAC 2005»
15 years 5 months ago
Synthesis of quantum logic circuits
— The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention...
Vivek V. Shende, Stephen S. Bullock, Igor L. Marko...
141
Voted
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 4 months ago
The detectability lemma and quantum gap amplification
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...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
148
Voted
STACS
2000
Springer
15 years 7 months ago
Average-Case Quantum Query Complexity
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...
Andris Ambainis, Ronald de Wolf
DAGSTUHL
2007
15 years 5 months ago
Classical Simulation Complexity of Quantum Branching Programs
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...
Farid M. Ablayev