Sciweavers

16 search results - page 2 / 4
» Smaller Two-Qubit Circuits for Quantum Communication and Com...
Sort
View
ICCAD
2002
IEEE
189views Hardware» more  ICCAD 2002»
14 years 2 months ago
Reversible logic circuit synthesis
Reversible, or information-lossless, circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requir...
Vivek V. Shende, Aditya K. Prasad, Igor L. Markov,...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 9 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
13 years 12 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
13 years 10 months ago
On the Power of Quantum Proofs
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
Ran Raz, Amir Shpilka