Result 1 to 20 of 38 total
Theory of quantum computation, communication, and cryptography. 5th conference, TQC 2010, Leeds, UK, April 13‒15, 2010. Revised selected papers. (English)
Lecture Notes in Computer Science 6519. Berlin: Springer (ISBN 978-3-642-18072-9/pbk). viii, 187~p. EUR~49.22 (2011).
1
Quantum algorithms for algebraic problems. (English)
Rev. Mod. Phys. 82, No. 1, 1-52 (2010).
2
Quantum online memory checking. (English)
Comput. Res. Repos. 2010, Article No. 1002.2970 (2010).
3
Recent progress in quantum algorithms. (English)
Commun. ACM 53, No. 2, 84-93 (2010).
4
Quantum online memory checking. (English)
Childs, Andrew (ed.) et al., Theory of quantum computation, communication, and cryptography. 4th workshop, TQC 2009, Waterloo, Canada, May 11‒13, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10697-2/pbk). Lecture Notes in Computer Science 5906, 10-19 (2009).
5
Quantum online memory checking (English)
TCQ, 10-19 (2009).
6
Classical and quantum algorithms for exponential congruences. (English)
Kawano, Yasuhito (ed.) et al., Theory of quantum computation, communication, and cryptography. Third workshop, TQC 2008, Tokyo, Japan, January 30‒February 1, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89303-5/pbk). Lecture Notes in Computer Science 5106, 1-10 (2008).
7
Adiabatic quantum computation is equivalent to standard quantum computation. (English)
SIAM Rev. 50, No. 4, 755-787 (2008).
8
Classical and quantum algorithms for exponential congruences (English)
TQC, 1-10 (2008).
9
Self-testing of universal and fault-tolerant sets of quantum gates. (English)
SIAM J. Comput. 37, No. 2, 611-629 (2007).
10
Adiabatic quantum computation is equivalent to standard quantum computation. (English)
SIAM J. Comput. 37, No. 1, 166-194 (2007).
11
Optimal phase estimation in quantum networks. (English)
J. Phys. A, Math. Theor. 40, No. 28, 7971-7984 (2007).
12
Quantum algorithm for a generalized hidden shift problem (English)
SODA, 1225-1232 (2007).
13
Optimal measurements for the dihedral hidden subgroup problem. (English)
Chic. J. Theor. Comput. Sci. 2006, Article No. 2, 25 p., electronic only (2006).
14
Quantum algorithms for some hidden shift problems. (English)
SIAM J. Comput. 36, No. 3, 763-778 (2006).
15
The statistical strength of nonlocality proofs. (English)
IEEE Trans. Inf. Theory 51, No. 8, 2812-2835 (2005).
16
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups (English)
FOCS, 469-478 (2005).
17
Adiabatic quantum computation is equivalent to standard quantum computation (English)
FOCS, 42-51 (2004).
18
Quantum algorithms for some hidden shift problems. (English)
Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12‒14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 489-498 (2003).
19
Quantum algorithms for some hidden shift problems (English)
SODA, 489-498 (2003).
20
Result 1 to 20 of 38 total
Start
Contact
Print
General Help
