default search action
Michele Mosca
Person information
- affiliation: University of Waterloo, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j23]Vlad Gheorghiu
, Michele Mosca:
Quantum resource estimation for large scale quantum algorithms. Future Gener. Comput. Syst. 162: 107480 (2025) - 2024
- [i30]Dohun Kim, Minyoung Kim, Sarah Meng Li, Michele Mosca:
Improving the Fidelity of CNOT Circuits on NISQ Hardware. CoRR abs/2405.19891 (2024) - 2023
- [j22]Vlad Gheorghiu, Jiaxin Huang
Reducing the CNOT Count for Clifford+T Circuits on NISQ Architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(6): 1873-1884 (2023) - [c23]Jiaxin Huang, Sarah Meng Li, Lia Yeh, Aleks Kissinger, Michele Mosca, Michael Vasmer:
Graphical CSS Code Transformation Using ZX Calculus. QPL 2023: 1-19 - 2021
- [c22]Amelia Holcomb, Geovandro C. C. F. Pereira, Bhargav Das, Michele Mosca:
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks. IEEE ICBC 2021: 1-9 - [i29]Stacey Jeffery, Michele Mosca, María Naya-Plasencia, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 21421). Dagstuhl Reports 11(9): 64-79 (2021) - 2020
- [i28]Bhargav Das, Amelia Holcomb, Michele Mosca, Geovandro C. C. F. Pereira:
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks. CoRR abs/2010.06571 (2020)
2010 – 2019
- 2019
- [j21]Matthew Amy
T-Count Optimization and Reed-Muller Codes. IEEE Trans. Inf. Theory 65(8): 4771-4784 (2019) - [i27]Michele Mosca, Sebastian R. Verschoor:
Factoring semi-primes with (quantum) SAT-solvers. CoRR abs/1902.01448 (2019) - [i26]Michele Mosca, João Marcos Vensi Basso, Sebastian R. Verschoor:
On speeding up factoring with quantum SAT solvers. CoRR abs/1910.09592 (2019) - [i25]Michele Mosca, María Naya-Plasencia, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 19421). Dagstuhl Reports 9(10): 47-60 (2019) - 2018
- [j20]Johannes Buchmann, Kristin E. Lauter, Michele Mosca:
Postquantum Cryptography, Part 2. IEEE Secur. Priv. 16(5): 12-13 (2018) - [j19]Michele Mosca:
Cybersecurity in an Era with Quantum Computers: Will We Be Ready? IEEE Secur. Priv. 16(5): 38-41 (2018) - [i24]Michele Mosca, Martin Roetteler, Peter Selinger:
Quantum Programming Languages (Dagstuhl Seminar 18381). Dagstuhl Reports 8(9): 112-132 (2018) - 2017
- [j18]Johannes Buchmann, Kristin E. Lauter, Michele Mosca:
Postquantum Cryptography - State of the Art. IEEE Secur. Priv. 15(4): 12-13 (2017) - [j17]John Mulholland, Michele Mosca, Johannes Braun:
The Day the Cryptography Dies. IEEE Secur. Priv. 15(4): 14-21 (2017) - [c21]Daniel J. Bernstein, Jean-François Biasse
A Low-Resource Quantum Factoring Algorithm. PQCrypto 2017: 330-346 - [c20]Alex Parent, Martin Roetteler
Improved reversible and quantum circuits for Karatsuba-based integer multiplication. TQC 2017: 7:1-7:15 - [i23]Alex Parent, Martin Roetteler
Improved reversible and quantum circuits for Karatsuba-based integer multiplication. CoRR abs/1706.03419 (2017) - [i22]Piotr K. Tysowski, Xinhua Ling, Norbert Lütkenhaus, Michele Mosca:
The Engineering of a Scalable Multi-Site Communications System Utilizing Quantum Key Distribution (QKD). CoRR abs/1712.02617 (2017) - [i21]Michele Mosca, Nicolas Sendrier, Rainer Steinwandt, Krysta M. Svore:
Quantum Cryptanalysis (Dagstuhl Seminar 17401). Dagstuhl Reports 7(10): 1-13 (2017) - [i20]Daniel J. Bernstein, Jean-François Biasse, Michele Mosca:
A low-resource quantum factoring algorithm. IACR Cryptol. ePrint Arch. 2017: 352 (2017) - 2016
- [j16]Vadym Kliuchnikov, Dmitri Maslov
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits. IEEE Trans. Computers 65(1): 161-172 (2016) - [c19]Douglas Stebila
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project. SAC 2016: 14-37 - [c18]Matthew Amy, Olivia Di Matteo
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3. SAC 2016: 317-337 - [r3]Michele Mosca:
Abelian Hidden Subgroup Problem. Encyclopedia of Algorithms 2016: 1-5 - [i19]Matthew Amy, Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca, Alex Parent, John M. Schanck:
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. IACR Cryptol. ePrint Arch. 2016: 992 (2016) - [i18]Douglas Stebila, Michele Mosca:
Post-Quantum Key Exchange for the Internet and the Open Quantum Safe Project. IACR Cryptol. ePrint Arch. 2016: 1017 (2016) - 2015
- [j15]Thijs Laarhoven
Finding shortest lattice vectors faster using quantum search. Des. Codes Cryptogr. 77(2-3): 375-400 (2015) - [c17]Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor, Michele Mosca, Priyaa Varshinee Srinivasan:
On the Robustness of Bucket Brigade Quantum RAM. TQC 2015: 226-244 - [i17]Michele Mosca, Martin Roetteler
Quantum Cryptanalysis (Dagstuhl Seminar 15371). Dagstuhl Reports 5(9): 1-17 (2015) - [i16]Michele Mosca:
Cybersecurity in an era with quantum computers: will we be ready? IACR Cryptol. ePrint Arch. 2015: 1075 (2015) - 2014
- [j14]David Gosset, Vadym Kliuchnikov, Michele Mosca, Vincent Russo:
An algorithm for the T-count. Quantum Inf. Comput. 14(15-16): 1261-1276 (2014) - [j13]Matthew Amy, Dmitri Maslov
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10): 1476-1489 (2014) - [j12]Lawrence M. Ioannou, Michele Mosca:
Public-key cryptography based on bounded quantum reference frames. Theor. Comput. Sci. 560: 33-45 (2014) - [e3]Michele Mosca:
Post-Quantum Cryptography - 6th International Workshop, PQCrypto 2014, Waterloo, ON, Canada, October 1-3, 2014. Proceedings. Lecture Notes in Computer Science 8772, Springer 2014, ISBN 978-3-319-11658-7 [contents] - [i15]Thijs Laarhoven, Michele Mosca, Joop van de Pol:
Finding shortest lattice vectors faster using quantum search. IACR Cryptol. ePrint Arch. 2014: 907 (2014) - 2013
- [j11]Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca:
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates. Quantum Inf. Comput. 13(7-8): 607-630 (2013) - [j10]Matthew Amy, Dmitri Maslov
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6): 818-830 (2013) - [c16]Thijs Laarhoven
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. PQCrypto 2013: 83-101 - [c15]Michele Mosca, Douglas Stebila
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework. PQCrypto 2013: 136-154 - [i14]Thijs Laarhoven
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. CoRR abs/1301.6176 (2013) - [i13]Matthew Amy, Dmitri Maslov
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning. CoRR abs/1303.2042 (2013) - [i12]Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 13371). Dagstuhl Reports 3(9): 59-73 (2013) - 2012
- [c14]Michele Mosca:
Quantum Computing, Cryptography and Compilers. ISMVL 2012: 154-156 - [p1]Jamie Smith, Michele Mosca:
Algorithms for Quantum Computers. Handbook of Natural Computing 2012: 1451-1492 - [i11]Matthew Amy, Dmitri Maslov
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. CoRR abs/1206.0758 (2012) - [i10]Vadym Kliuchnikov
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates. CoRR abs/1206.5236 (2012) - [i9]Vadym Kliuchnikov, Dmitri Maslov
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits. CoRR abs/1212.0822 (2012) - [i8]Vadym Kliuchnikov
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits. CoRR abs/1212.6964 (2012) - [i7]Michele Mosca, Douglas Stebila, Berkant Ustaoglu:
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework. IACR Cryptol. ePrint Arch. 2012: 361 (2012) - 2011
- [c13]Lawrence M. Ioannou, Michele Mosca:
A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys. PQCrypto 2011: 255-274 - [c12]Lawrence M. Ioannou, Michele Mosca:
Unconditionally-Secure and Reusable Public-Key Authentication. TQC 2011: 121-142 - [i6]Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 11381). Dagstuhl Reports 1(9): 58-75 (2011) - 2010
- [j9]Lawrence M. Ioannou, Michele Mosca:
Universal quantum computation in a hidden basis. Quantum Inf. Comput. 10(7&8): 541-561 (2010) - [c11]Matthew McKague
Generalized Self-testing and the Security of the 6-State Protocol. TQC 2010: 113-130
2000 – 2009
- 2009
- [c10]Douglas Stebila
The Case for Quantum Key Distribution. QuantumComm 2009: 283-296 - [c9]Richard Cleve, Daniel Gottesman
Efficient discrete-time simulations of continuous-time quantum query algorithms. STOC 2009: 409-416 - [e2]Andrew M. Childs, Michele Mosca:
Theory of Quantum Computation, Communication, and Cryptography, 4th Workshop, TQC 2009, Waterloo, Canada, May 11-13, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5906, Springer 2009, ISBN 978-3-642-10697-2 [contents] - [r2]Michele Mosca:
Quantum Algorithms. Encyclopedia of Complexity and Systems Science 2009: 7088-7118 - [i5]Douglas Stebila, Michele Mosca, Norbert Lütkenhaus:
The Case for Quantum Key Distribution. IACR Cryptol. ePrint Arch. 2009: 82 (2009) - 2008
- [j8]Dmitri Maslov
Quantum Circuit Placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(4): 752-763 (2008) - [e1]Yasuhito Kawano, Michele Mosca:
Theory of Quantum Computation, Communication, and Cryptography, Third Workshop, TQC 2008, Tokyo, Japan, January 30 - February 1, 2008. Revised Selected Papers. Lecture Notes in Computer Science 5106, Springer 2008, ISBN 978-3-540-89303-5 [contents] - [r1]Michele Mosca:
Abelian Hidden Subgroup Problem. Encyclopedia of Algorithms 2008 - 2007
- [j7]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. SIAM J. Comput. 37(2): 611-629 (2007) - [c8]Dmitri Maslov, Sean M. Falconer, Michele Mosca:
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment. DAC 2007: 962-965 - 2006
- [b1]Phillip Kaye, Raymond Laflamme, Michele Mosca:
An Introduction to Quantum Computing. Oxford University Press 2006, ISBN 978-0-19-857000-4, pp. I-XI, 1-274 - [c7]Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier:
Self-testing of Quantum Circuits. ICALP (1) 2006: 72-83 - 2003
- [c6]Peter Høyer, Michele Mosca, Ronald de Wolf:
Quantum Search on Bounded-Error Inputs. ICALP 2003: 291-299 - [i4]Peter Høyer, Michele Mosca, Ronald de Wolf:
Quantum Search on Bounded-Error Inputs. CoRR quant-ph/0304052 (2003) - 2002
- [j6]Michele Mosca, Alain Tapp:
Introduction. Algorithmica 34(4): 309-313 (2002) - 2001
- [j5]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum lower bounds by polynomials. J. ACM 48(4): 778-797 (2001) - [j4]Kevin K. H. Cheung, Michele Mosca:
Decomposing finite Abelian groups. Quantum Inf. Comput. 1(3): 26-32 (2001) - [j3]Michele Mosca:
Counting by quantum eigenvalue estimation. Theor. Comput. Sci. 264(1): 139-153 (2001) - [c5]Wim van Dam, Michele Mosca, Umesh V. Vazirani:
How Powerful is Adiabatic Quantum Computation?. FOCS 2001: 279-287 - [i3]Kevin K. H. Cheung, Michele Mosca:
Decomposing Finite Abelian Groups. CoRR cs.DS/0101004 (2001) - 2000
- [c4]Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf:
Private Quantum Channels. FOCS 2000: 547-553 - [c3]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-testing of universal and fault-tolerant sets of quantum gates. STOC 2000: 688-696
1990 – 1999
- 1999
- [i2]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. CoRR quant-ph/9904108 (1999) - 1998
- [j2]Richard Cleve, Artur Ekert, Leah Henderson, Chiara Macchiavello, Michele Mosca:
On quantum algorithms. Complex. 4(1): 33-42 (1998) - [j1]Michele Mosca:
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph. Comb. Probab. Comput. 7(2): 211-216 (1998) - [c2]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. FOCS 1998: 352-361 - [c1]Michele Mosca, Artur Ekert:
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer. QCQC 1998: 174-188 - [i1]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. CoRR quant-ph/9802049 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: