Michele Mosca

87 papers A* 7C 5Misc 2Journal 54Unranked 12
YearRankTypeTitle / Venue / Authors
2025 — conf
A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits.
QPL
Sarah Meng Li, Michele Mosca, Neil J. Ross, John van de Wetering, Yuming Zhao
2025 J jnl
Quantum resource estimation for large scale quantum algorithms.
Future Gener. Comput. Syst.
Vlad Gheorghiu, Michele Mosca
2025 J jnl
Synthesis and Arithmetic of Single Qutrit Circuits.
Quantum
Amolak Ratan Kalra, Michele Mosca, Dinesh Valluri
2024 J jnl
Improving the Fidelity of CNOT Circuits on NISQ Hardware.
CoRR
Dohun Kim, Minyoung Kim, Sarah Meng Li, Michele Mosca
2024 — conf
Pragmatic Obfuscation of Factoring in Hamiltonian Simulation and Ground State Estimation.
TPS-ISA
Dhruv Gopalakrishnan, Michele Mosca
2023 — conf
Graphical CSS Code Transformation Using ZX Calculus.
QPL
Jiaxin Huang, Sarah Meng Li, Lia Yeh, Aleks Kissinger, Michele Mosca, Michael Vasmer
2023 J jnl
Reducing the CNOT Count for Clifford+T Circuits on NISQ Architectures.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Vlad Gheorghiu, Jiaxin Huang, Sarah Meng Li, Michele Mosca, Priyanka Mukhopadhyay
2021 — conf
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks.
IEEE ICBC
Amelia Holcomb, Geovandro C. C. F. Pereira, Bhargav Das, Michele Mosca
2021 J jnl
Quantum Cryptanalysis (Dagstuhl Seminar 21421).
Dagstuhl Reports
Stacey Jeffery, Michele Mosca, María Naya-Plasencia, Rainer Steinwandt
2020 J jnl
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks.
CoRR
Bhargav Das, Amelia Holcomb, Michele Mosca, Geovandro C. C. F. Pereira
2019 J jnl
Factoring semi-primes with (quantum) SAT-solvers.
CoRR
Michele Mosca, Sebastian R. Verschoor
2019 J jnl
On speeding up factoring with quantum SAT solvers.
CoRR
Michele Mosca, João Marcos Vensi Basso, Sebastian R. Verschoor
2019 J jnl
Quantum Cryptanalysis (Dagstuhl Seminar 19421).
Dagstuhl Reports
Michele Mosca, María Naya-Plasencia, Rainer Steinwandt
2019 J jnl
T-Count Optimization and Reed-Muller Codes.
IEEE Trans. Inf. Theory
Matthew Amy, Michele Mosca
2018 J jnl
Cybersecurity in an Era with Quantum Computers: Will We Be Ready?
IEEE Secur. Priv.
Michele Mosca
2018 J jnl
Postquantum Cryptography, Part 2.
IEEE Secur. Priv.
Johannes Buchmann, Kristin E. Lauter, Michele Mosca
2018 J jnl
Quantum Programming Languages (Dagstuhl Seminar 18381).
Dagstuhl Reports
Michele Mosca, Martin Roetteler, Peter Selinger
2017 C conf
A Low-Resource Quantum Factoring Algorithm.
PQCrypto
Daniel J. Bernstein, Jean-François Biasse, Michele Mosca
2017 J jnl
A low-resource quantum factoring algorithm.
IACR Cryptol. ePrint Arch.
Daniel J. Bernstein, Jean-François Biasse, Michele Mosca
2017 — conf
Improved reversible and quantum circuits for Karatsuba-based integer multiplication.
TQC
Alex Parent, Martin Roetteler, Michele Mosca
2017 J jnl
Improved reversible and quantum circuits for Karatsuba-based integer multiplication.
CoRR
Alex Parent, Martin Roetteler, Michele Mosca
2017 J jnl
Postquantum Cryptography - State of the Art.
IEEE Secur. Priv.
Johannes Buchmann, Kristin E. Lauter, Michele Mosca
2017 J jnl
Quantum Cryptanalysis (Dagstuhl Seminar 17401).
Dagstuhl Reports
Michele Mosca, Nicolas Sendrier, Rainer Steinwandt, Krysta M. Svore
2017 J jnl
The Day the Cryptography Dies.
IEEE Secur. Priv.
John Mulholland, Michele Mosca, Johannes Braun
2017 J jnl
The Engineering of a Scalable Multi-Site Communications System Utilizing Quantum Key Distribution (QKD).
CoRR
Piotr K. Tysowski, Xinhua Ling, Norbert Lütkenhaus, Michele Mosca
2016 — ch.
Abelian Hidden Subgroup Problem.
Encyclopedia of Algorithms
Michele Mosca
2016 Misc conf
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3.
SAC
Matthew Amy, Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca, Alex Parent, John M. Schanck
2016 J jnl
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3.
IACR Cryptol. ePrint Arch.
Matthew Amy, Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca, Alex Parent, John M. Schanck
2016 J jnl
Post-Quantum Key Exchange for the Internet and the Open Quantum Safe Project.
IACR Cryptol. ePrint Arch.
Douglas Stebila, Michele Mosca
2016 Misc conf
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project.
SAC
Douglas Stebila, Michele Mosca
2016 J jnl
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits.
IEEE Trans. Computers
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2015 J jnl
Cybersecurity in an era with quantum computers: will we be ready?
IACR Cryptol. ePrint Arch.
Michele Mosca
2015 J jnl
Finding shortest lattice vectors faster using quantum search.
Des. Codes Cryptogr.
Thijs Laarhoven, Michele Mosca, Joop van de Pol
2015 — conf
On the Robustness of Bucket Brigade Quantum RAM.
TQC
Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor, Michele Mosca, Priyaa Varshinee Srinivasan
2015 J jnl
Quantum Cryptanalysis (Dagstuhl Seminar 15371).
Dagstuhl Reports
Michele Mosca, Martin Roetteler, Nicolas Sendrier, Rainer Steinwandt
2014 J jnl
An algorithm for the T-count.
Quantum Inf. Comput.
David Gosset, Vadym Kliuchnikov, Michele Mosca, Vincent Russo
2014 J jnl
Finding shortest lattice vectors faster using quantum search.
IACR Cryptol. ePrint Arch.
Thijs Laarhoven, Michele Mosca, Joop van de Pol
2014 J jnl
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Matthew Amy, Dmitri Maslov, Michele Mosca
2014 C ed.
Post-Quantum Cryptography - 6th International Workshop, PQCrypto 2014, Waterloo, ON, Canada, October 1-3, 2014. Proceedings
PQCrypto
Michele Mosca
2014 J jnl
Public-key cryptography based on bounded quantum reference frames.
Theor. Comput. Sci.
Lawrence M. Ioannou, Michele Mosca
2013 J jnl
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler
2013 J jnl
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates.
Quantum Inf. Comput.
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2013 J jnl
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
CoRR
Matthew Amy, Dmitri Maslov, Michele Mosca
2013 J jnl
Quantum Cryptanalysis (Dagstuhl Seminar 13371).
Dagstuhl Reports
Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt
2013 C conf
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework.
PQCrypto
Michele Mosca, Douglas Stebila, Berkant Ustaoglu
2013 J jnl
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
CoRR
Thijs Laarhoven, Michele Mosca, Joop van de Pol
2013 C conf
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search.
PQCrypto
Thijs Laarhoven, Michele Mosca, Joop van de Pol
2012 J jnl
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
CoRR
Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler
2012 — ch.
Algorithms for Quantum Computers.
Handbook of Natural Computing
Jamie Smith, Michele Mosca
2012 J jnl
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
CoRR
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2012 J jnl
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
CoRR
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2012 J jnl
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
CoRR
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2012 — conf
Quantum Computing, Cryptography and Compilers.
ISMVL
Michele Mosca
2012 J jnl
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework.
IACR Cryptol. ePrint Arch.
Michele Mosca, Douglas Stebila, Berkant Ustaoglu
2011 C conf
A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys.
PQCrypto
Lawrence M. Ioannou, Michele Mosca
2011 J jnl
Quantum Cryptanalysis (Dagstuhl Seminar 11381).
Dagstuhl Reports
Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt
2011 — conf
Unconditionally-Secure and Reusable Public-Key Authentication.
TQC
Lawrence M. Ioannou, Michele Mosca
2010 — conf
Generalized Self-testing and the Security of the 6-State Protocol.
TQC
Matthew McKague, Michele Mosca
2010 J jnl
Universal quantum computation in a hidden basis.
Quantum Inf. Comput.
Lawrence M. Ioannou, Michele Mosca
2009 A* conf
Efficient discrete-time simulations of continuous-time quantum query algorithms.
STOC
Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo
2009 — ch.
Quantum Algorithms.
Encyclopedia of Complexity and Systems Science
Michele Mosca
2009 — conf
The Case for Quantum Key Distribution.
QuantumComm
Douglas Stebila, Michele Mosca, Norbert Lütkenhaus
2009 J jnl
The Case for Quantum Key Distribution.
IACR Cryptol. ePrint Arch.
Douglas Stebila, Michele Mosca, Norbert Lütkenhaus
2009 — ed.
Theory of Quantum Computation, Communication, and Cryptography, 4th Workshop, TQC 2009, Waterloo, Canada, May 11-13, 2009, Revised Selected Papers
TCQ
Andrew M. Childs, Michele Mosca
2008 — ch.
Abelian Hidden Subgroup Problem.
Encyclopedia of Algorithms
Michele Mosca
2008 J jnl
Quantum Circuit Placement.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Dmitri Maslov, Sean M. Falconer, Michele Mosca
2008 — ed.
Theory of Quantum Computation, Communication, and Cryptography, Third Workshop, TQC 2008, Tokyo, Japan, January 30 - February 1, 2008. Revised Selected Papers
TQC
Yasuhito Kawano, Michele Mosca
2007 A* conf
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment.
DAC
Dmitri Maslov, Sean M. Falconer, Michele Mosca
2007 J jnl
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates.
SIAM J. Comput.
Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
2006 — book
An Introduction to Quantum Computing.
Phillip Kaye, Raymond Laflamme, Michele Mosca
2006 — conf
Self-testing of Quantum Circuits.
ICALP (1)
Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier
2003 J jnl
Quantum Search on Bounded-Error Inputs
CoRR
Peter Høyer, Michele Mosca, Ronald de Wolf
2003 A* conf
Quantum Search on Bounded-Error Inputs.
ICALP
Peter Høyer, Michele Mosca, Ronald de Wolf
2002 J jnl
Introduction.
Algorithmica
Michele Mosca, Alain Tapp
2001 J jnl
Counting by quantum eigenvalue estimation.
Theor. Comput. Sci.
Michele Mosca
2001 J jnl
Decomposing Finite Abelian Groups
CoRR
Kevin K. H. Cheung, Michele Mosca
2001 J jnl
Decomposing finite Abelian groups.
Quantum Inf. Comput.
Kevin K. H. Cheung, Michele Mosca
2001 A* conf
How Powerful is Adiabatic Quantum Computation?.
FOCS
Wim van Dam, Michele Mosca, Umesh V. Vazirani
2001 J jnl
Quantum lower bounds by polynomials.
J. ACM
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
2000 A* conf
Private Quantum Channels.
FOCS
Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf
2000 A* conf
Self-testing of universal and fault-tolerant sets of quantum gates.
STOC
Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
1999 J jnl
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
CoRR
Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
1998 J jnl
On quantum algorithms.
Complex.
Richard Cleve, Artur Ekert, Leah Henderson, Chiara Macchiavello, Michele Mosca
1998 J jnl
Quantum Lower Bounds by Polynomials
CoRR
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1998 A* conf
Quantum Lower Bounds by Polynomials.
FOCS
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1998 J jnl
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph.
Comb. Probab. Comput.
Michele Mosca
1998 — conf
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer.
QCQC
Michele Mosca, Artur Ekert