Sciweavers

164 search results - page 19 / 33
» The Learnability of Quantum States
Sort
View
FOCS
2000
IEEE
15 years 3 months ago
Succinct quantum proofs for properties of finite groups
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
John Watrous
COMPUTER
2002
79views more  COMPUTER 2002»
14 years 11 months ago
A Practical Architecture for Reliable Quantum Computers
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang
AUTOMATICA
2007
81views more  AUTOMATICA 2007»
14 years 12 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
CORR
2000
Springer
81views Education» more  CORR 2000»
14 years 11 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
94
Voted
TIT
2008
140views more  TIT 2008»
14 years 11 months ago
A Resource Framework for Quantum Shannon Theory
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...
Igor Devetak, Aram Wettroth Harrow, Andreas J. Win...