Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Mosca, Michele"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Public-key cryptography based on bounded quantum reference frames
Lawrence M. Ioannou
,
Michele Mosca
Theoretical Computer Science
560, Part 1
, 2014, pp. 33-45
Efficient discrete-time simulations of continuous-time quantum query algorithms
Richard Cleve
,
Daniel Gottesman
,
Michele Mosca
,
Rolando D. Somma
,
David Yonge-Mallo
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 409-416
Self-testing of universal and fault-tolerant sets of quantum gates
Wim van Dam
,
Frédéric Magniez
,
Michele Mosca
,
Miklos Santha
SIAM Journal on Computing
37
(2), 2007, pp. 611-629
Self-testing of quantum circuits
Frédéric Magniez
,
Dominic Mayers
,
Michele Mosca
,
Harold Ollivier
Lecture Notes in Computer Science
4051
, 2006, pp. 72-83
Quantum search on bounded-error inputs
Peter Hyer
,
Michele Mosca
,
Ronald de Wolf
Lecture Notes in Computer Science
2719
, 2003, pp. 291-299
Introduction
Michele Mosca
,
Alain Tapp
Algorithmica
34
(4), 2002, pp. 309-313
Quantum lower bounds by polynomials
Robert Beals
,
Harry Buhrman
,
Richard Cleve
,
Michele Mosca
,
Ronald de Wolf
Journal of the ACM
48
(4), 2001, pp. 778-797
Counting by quantum eingenvalue estimation
Michele Mosca
Theoretical Computer Science
264
(1), 2001, pp. 139-153
Self-testing of universal and fault-tolerant sets of quantum gates
Wim van Dam
,
Frédéric Magniez
,
Michele Mosca
,
Miklos Santha
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 688-696
Quantum lower bounds by polynomials
Robert Beals
,
Harry Buhrman
,
Richard Cleve
,
Michele Mosca
,
Ronald de Wolf
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 352-361