Michele Mosca

From MaRDI portal
Person:477169

Available identifiers

zbMath Open mosca.micheleDBLP95/2541WikidataQ6836805 ScholiaQ6836805MaRDI QIDQ477169

List of research outcomes





PublicationDate of PublicationType
Graphical CSS Code Transformation Using ZX Calculus2024-03-22Paper
On the robustness of bucket brigade quantum RAM2021-01-15Paper
T-Count Optimization and Reed–Muller Codes2019-07-19Paper
Pauli Partitioning with Respect to Gate Sets2019-07-17Paper
A low-resource quantum factoring algorithm2018-09-12Paper
Improved reversible and quantum circuits for Karatsuba-based integer multiplication.2018-05-03Paper
Post-quantum key exchange for the Internet and the open quantum safe project2018-02-16Paper
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-32018-02-16Paper
On the Robustness of Bucket Brigade Quantum RAM2017-07-12Paper
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits2017-05-16Paper
Unconditionally-Secure and Reusable Public-Key Authentication2015-11-20Paper
Finding shortest lattice vectors faster using quantum search2015-10-26Paper
Efficient discrete-time simulations of continuous-time quantum query algorithms2015-02-04Paper
Public-key cryptography based on bounded quantum reference frames2014-12-02Paper
Self-testing of universal and fault-tolerant sets of quantum gates2014-09-26Paper
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework2013-06-14Paper
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search2013-06-14Paper
A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys2011-11-25Paper
https://portal.mardi4nfdi.de/entity/Q31724422011-10-05Paper
https://portal.mardi4nfdi.de/entity/Q30008952011-05-31Paper
Generalized Self-testing and the Security of the 6-State Protocol2011-01-28Paper
The Case for Quantum Key Distribution2010-12-21Paper
Self-testing of Quantum Circuits2009-03-12Paper
LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS2008-11-03Paper
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates2008-04-22Paper
Quantum lower bounds by polynomials2008-02-11Paper
Optimal phase estimation in quantum networks2007-08-01Paper
https://portal.mardi4nfdi.de/entity/Q34105502006-11-27Paper
EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS2005-05-09Paper
https://portal.mardi4nfdi.de/entity/Q48195892004-09-27Paper
https://portal.mardi4nfdi.de/entity/Q44491832004-02-08Paper
Quantum networks for concentrating entanglement2002-01-27Paper
Quantum–enhanced information processing2001-09-16Paper
https://portal.mardi4nfdi.de/entity/Q49391502000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42403421999-05-03Paper
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph1999-03-18Paper
Quantum algorithms revisited1999-01-06Paper

Research outcomes over time

This page was built for person: Michele Mosca