Sciweavers

1352 search results - page 131 / 271
» Fault-Tolerant Quantum Computation
Sort
View
STACS
2000
Springer
13 years 11 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
13 years 9 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
ICCS
2004
Springer
14 years 1 months ago
Applying Grid Computing to the Parameter Sweep of a Group Difference Pseudopotential
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...
Wibke Sudholt, Kim Baldridge, David Abramson, Coli...
ICALP
2010
Springer
13 years 6 months ago
Rewriting Measurement-Based Quantum Computations with Generalised Flow
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...
Ross Duncan, Simon Perdrix
QCQC
1998
Springer
104views Communications» more  QCQC 1998»
14 years 6 days ago
Trapped Ion Quantum Computer Research at Los Alamos
Abstract. We briefly review the development and theory of an experiment to investigate quantum computation with trapped calcium ions. The ion trap, laser and ion requirements are d...
D. F. V. James, M. S. Gulley, M. H. Holzscheiter, ...