Sciweavers

587 search results - page 52 / 118
» Quantum computation and quantum information
Sort
View
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 3 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
ISMVL
2008
IEEE
102views Hardware» more  ISMVL 2008»
14 years 4 months ago
On the Data Structure Metrics of Quantum Multiple-Valued Decision Diagrams
This paper describes new metrics for the data structure referred to as quantum multiple-valued decision diagrams (QMDD) which are used to represent the matrices describing reversi...
David Y. Feinstein, Mitchell A. Thornton, D. Micha...
AUTOMATICA
2007
81views more  AUTOMATICA 2007»
13 years 10 months ago
Feedback control of quantum entanglement in a two-spin system
— A pair of spins is the most simple quantum system that can possess entanglement, a non-classical property playing an essential role in quantum information technologies. In this...
Naoki Yamamoto, Koji Tsumura, Shinji Hara
FOCS
2007
IEEE
14 years 4 months ago
Quantum Algorithms for Hidden Nonlinear Structures
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
Andrew M. Childs, Leonard J. Schulman, Umesh V. Va...
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 9 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson