Michele Mosca

According to our database1, Michele Mosca authored at least 54 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
T-Count Optimization and Reed-Muller Codes.
IEEE Trans. Information Theory, 2019

On speeding up factoring with quantum SAT solvers.
CoRR, 2019

Factoring semi-primes with (quantum) SAT-solvers.
CoRR, 2019

2018
Cybersecurity in an Era with Quantum Computers: Will We Be Ready?
IEEE Security & Privacy, 2018

Postquantum Cryptography, Part 2.
IEEE Security & Privacy, 2018

Quantum Programming Languages (Dagstuhl Seminar 18381).
Dagstuhl Reports, 2018

2017
The Day the Cryptography Dies.
IEEE Security & Privacy, 2017

Postquantum Cryptography - State of the Art.
IEEE Security & Privacy, 2017

A low-resource quantum factoring algorithm.
IACR Cryptology ePrint Archive, 2017

Quantum Cryptanalysis (Dagstuhl Seminar 17401).
Dagstuhl Reports, 2017

The Engineering of a Scalable Multi-Site Communications System Utilizing Quantum Key Distribution (QKD).
CoRR, 2017

Improved reversible and quantum circuits for Karatsuba-based integer multiplication.
Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

2016
Abelian Hidden Subgroup Problem.
Encyclopedia of Algorithms, 2016

Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits.
IEEE Trans. Computers, 2016

Post-Quantum Key Exchange for the Internet and the Open Quantum Safe Project.
IACR Cryptology ePrint Archive, 2016

Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3.
IACR Cryptology ePrint Archive, 2016

2015
Finding shortest lattice vectors faster using quantum search.
Des. Codes Cryptogr., 2015

Quantum Cryptanalysis (Dagstuhl Seminar 15371).
Dagstuhl Reports, 2015

On the Robustness of Bucket Brigade Quantum RAM.
Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

2014
Public-key cryptography based on bounded quantum reference frames.
Theor. Comput. Sci., 2014

Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2014

An algorithm for the T-count.
Quantum Information & Computation, 2014

2013
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2013

Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates.
Quantum Information & Computation, 2013

Quantum Cryptanalysis (Dagstuhl Seminar 13371).
Dagstuhl Reports, 2013

Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search.
Proceedings of the Post-Quantum Cryptography - 5th International Workshop, 2013

2012
Algorithms for Quantum Computers.
Proceedings of the Handbook of Natural Computing, 2012

Quantum Key Distribution in the Classical Authenticated Key Exchange Framework.
IACR Cryptology ePrint Archive, 2012

Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
CoRR, 2012

Quantum Computing, Cryptography and Compilers.
Proceedings of the 42nd IEEE International Symposium on Multiple-Valued Logic, 2012

2011
Quantum Cryptanalysis (Dagstuhl Seminar 11381).
Dagstuhl Reports, 2011

Unconditionally-Secure and Reusable Public-Key Authentication.
Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2011

A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys.
Proceedings of the Post-Quantum Cryptography - 4th International Workshop, 2011

2010
Universal quantum computation in a hidden basis.
Quantum Information & Computation, 2010

Generalized Self-testing and the Security of the 6-State Protocol.
Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2010

2009
Quantum Algorithms.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

The Case for Quantum Key Distribution.
IACR Cryptology ePrint Archive, 2009

Efficient discrete-time simulations of continuous-time quantum query algorithms.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Abelian Hidden Subgroup Problem.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Quantum Circuit Placement.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2008

2007
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates.
SIAM J. Comput., 2007

Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment.
Proceedings of the 44th Design Automation Conference, 2007

2006
Self-testing of Quantum Circuits.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

An Introduction to Quantum Computing.
Oxford University Press, ISBN: 978-0-19-857000-4, 2006

2003
Quantum Search on Bounded-Error Inputs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Introduction.
Algorithmica, 2002

2001
Counting by quantum eigenvalue estimation.
Theor. Comput. Sci., 2001

Decomposing finite Abelian groups.
Quantum Information & Computation, 2001

Quantum lower bounds by polynomials.
J. ACM, 2001

How Powerful is Adiabatic Quantum Computation?.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Private Quantum Channels.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1998
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph.
Combinatorics, Probability & Computing, 1998

On quantum algorithms.
Complexity, 1998

The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer.
Proceedings of the Quantum Computing and Quantum Communications, 1998


  Loading...