Search the dblp DataBase
Michele Mosca: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf
Private Quantum Channels. [Citation Graph (0, 0)][DBLP]
FOCS, 2000, pp:547-553 [Conf] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum Lower Bounds by Polynomials. [Citation Graph (0, 0)][DBLP]
FOCS, 1998, pp:352-361 [Conf] - Wim van Dam, Michele Mosca, Umesh V. Vazirani
How Powerful is Adiabatic Quantum Computation?. [Citation Graph (0, 0)][DBLP]
FOCS, 2001, pp:279-287 [Conf] - Peter Høyer, Michele Mosca, Ronald de Wolf
Quantum Search on Bounded-Error Inputs. [Citation Graph (0, 0)][DBLP]
ICALP, 2003, pp:291-299 [Conf] - Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier
Self-testing of Quantum Circuits. [Citation Graph (0, 0)][DBLP]
ICALP (1), 2006, pp:72-83 [Conf] - Michele Mosca, Artur Ekert
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer. [Citation Graph (0, 0)][DBLP]
QCQC, 1998, pp:174-188 [Conf] - Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
Self-testing of universal and fault-tolerant sets of quantum gates. [Citation Graph (0, 0)][DBLP]
STOC, 2000, pp:688-696 [Conf] - Michele Mosca, Alain Tapp
Introduction. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2002, v:34, n:4, pp:309-313 [Journal] - Kevin K. H. Cheung, Michele Mosca
Decomposing Finite Abelian Groups [Citation Graph (0, 0)][DBLP]
CoRR, 2001, v:0, n:, pp:- [Journal] - Peter Høyer, Michele Mosca, Ronald de Wolf
Quantum Search on Bounded-Error Inputs [Citation Graph (0, 0)][DBLP]
CoRR, 2003, v:0, n:, pp:- [Journal] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum Lower Bounds by Polynomials [Citation Graph (0, 0)][DBLP]
CoRR, 1998, v:0, n:, pp:- [Journal] - Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates [Citation Graph (0, 0)][DBLP]
CoRR, 1999, v:0, n:, pp:- [Journal] - Michele Mosca
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph. [Citation Graph (0, 0)][DBLP]
Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:211-216 [Journal] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum lower bounds by polynomials. [Citation Graph (0, 0)][DBLP]
J. ACM, 2001, v:48, n:4, pp:778-797 [Journal] - Michele Mosca
Counting by quantum eigenvalue estimation. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2001, v:264, n:1, pp:139-153 [Journal] - Dmitri Maslov, Sean M. Falconer, Michele Mosca
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment. [Citation Graph (0, 0)][DBLP]
DAC, 2007, pp:962-965 [Conf] - Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2007, v:37, n:2, pp:611-629 [Journal]
Efficient discrete-time simulations of continuous-time quantum query algorithms. [Citation Graph (, )][DBLP]
The Case for Quantum Key Distribution. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002