Sciweavers

587 search results - page 25 / 118
» Quantum computation and quantum information
Sort
View
GBRPR
2005
Springer
14 years 3 months ago
Towards Unitary Representations for Graph Matching
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
David Emms, Simone Severini, Richard C. Wilson, Ed...
EUROCRYPT
2005
Springer
14 years 3 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
JACM
2006
146views more  JACM 2006»
13 years 10 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
TC
2010
13 years 8 months ago
Multicasting in Quantum Switching Networks
—In this paper, we present a quantum multicasting network, called a generalized quantum connector (n-GQC), which can be used to multicast quantum information from n inputs to n o...
Manish Kumar Shukla, A. Yavuz Oruç
CORR
2011
Springer
156views Education» more  CORR 2011»
13 years 1 months ago
From joint convexity of quantum relative entropy to a concavity theorem of Lieb
This paper provides a succinct proof of a 1973 theorem of Lieb that establishes the concavity of a certain trace function. The development relies on a deep result from quantum info...
Joel A. Tropp