Sciweavers

508 search results - page 19 / 102
» Quantum Computers
Sort
View
DAGSTUHL
2007
13 years 11 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
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 10 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...
EUROCRYPT
2001
Springer
14 years 2 months ago
How to Convert the Flavor of a Quantum Bit Commitment
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
Claude Crépeau, Frédéric L&ea...
CSL
2003
Springer
14 years 3 months ago
A Logic for Probability in Quantum Systems
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
Ron van der Meyden, Manas Patra
ICCS
2004
Springer
14 years 3 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...