Sciweavers

50 search results - page 1 / 10
» Classical Simulation Complexity of Quantum Branching Program...
Sort
View
DAGSTUHL
2007
13 years 6 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
FLOPS
2004
Springer
13 years 10 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
AIEDAM
2008
102views more  AIEDAM 2008»
13 years 5 months ago
Machine invention of quantum computing circuits by means of genetic programming
We demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We ...
Lee Spector, Jon Klein
ENTCS
2007
108views more  ENTCS 2007»
13 years 5 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
DAGSTUHL
2006
13 years 6 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum