Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (119)

Action Title Date Authors
Synthesis and Arithmetic of Single Qutrit Circuits 2025-02-26 Amolak Ratan Kalra Michele Mosca Dinesh Valluri
A square-root speedup for finding the smallest eigenvalue 2024-08-01 Alex Kerzner Vlad Gheorghiu Michele Mosca Thomas Guilbaud Federico Carminati Fabio Fracas Luca Dellantonio
qLUE: A Quantum Clustering Algorithm for Multi- Dimensional Datasets 2024-06-29 Dhruv Gopalakrishnan Luca Dellantonio Antonio Di Pilato W. Redjeb F. Pantaleo Michele Mosca
Improving the Fidelity of CNOT Circuits on NISQ Hardware 2024-05-30 Dohun Kim Minyoung Kim Sarah Meng Li Michele Mosca
Field demonstration of a fully managed, L1 encrypted 3-node network with hybrid relayed-QKD and centralized symmetric classical key management 2024-03-13 N. Makris Aris Papageorgopoulos Konstantinos Tsimvrakidis P. Konteli Yann Gautier M. Terenziani E. Daudin D. Ntoulias T. Fragkioudakis I. Meletios
Assessing the Benefits and Risks of Quantum Computers 2024-01-29 Travis L. Scholten Carl J. Williams Dustin Moody Michele Mosca William L. Hurley William J. Zeng Matthias Troyer Jay Gambetta
Graphical CSS Code Transformation Using ZX Calculus 2023-08-23 Jiaxin Huang Sarah Meng Li Lia Yeh Aleks Kissinger Michele Mosca Michael Vasmer
Graphical CSS Code Transformation Using ZX Calculus 2023-01-01 Jiaxin Huang Sarah Meng Li Lia Yeh Aleks Kissinger Michele Mosca Michael Vasmer
A square-root speedup for finding the smallest eigenvalue 2023-01-01 Alex Kerzner Vlad Gheorghiu Michele Mosca Thomas Guilbaud Federico Carminati Fabio Fracas Luca Dellantonio
Synthesis and Arithmetic of Single Qutrit Circuits 2023-01-01 Amolak Ratan Kalra Dinesh Valluri Michele Mosca
T-count and T-depth of any multi-qubit unitary 2022-11-30 Vlad Gheorghiu Michele Mosca Priyanka Mukhopadhyay
Reducing the CNOT Count for Clifford+T Circuits on NISQ Architectures 2022-10-10 Vlad Gheorghiu Jiaxin Huang Sarah Meng Li Michele Mosca Priyanka Mukhopadhyay
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits 2022-09-13 Vlad Gheorghiu Michele Mosca Priyanka Mukhopadhyay
Reducing the CNOT count for Clifford+T circuits on NISQ architectures 2022-05-16 Priyanka Mukhopadhyay Vlad Gheorghiu Jiaxin Huang Sarah Meng Li Michele Mosca
Reducing the CNOT count for Clifford+T circuits on NISQ architectures 2022-05-16 Priyanka Mukhopadhyay Vlad Gheorghiu Jiaxin Huang Sarah Meng Li Michele Mosca
A polynomial time and space heuristic algorithm for T-count 2021-10-07 Michele Mosca Priyanka Mukhopadhyay
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks 2021-05-03 Amelia Holcomb Geovandro C. C. F. Pereira Bhargav Das Michele Mosca
T-count and T-depth of any multi-qubit unitary 2021-01-01 Vlad Gheorghiu Michele Mosca Priyanka Mukhopadhyay
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits 2021-01-01 Vlad Gheorghiu Michele Mosca Priyanka Mukhopadhyay
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks. 2020-10-13 Amelia Holcomb Geovandro C. C. F. Pereira Bhargav Das Michele Mosca
On speeding up factoring with quantum SAT solvers 2020-09-14 Michele Mosca Joao Basso Sebastian R. Verschoor
A polynomial time and space heuristic algorithm for T-count. 2020-06-22 Michele Mosca Priyanka Mukhopadhyay
Quantum circuit optimizations for NISQ architectures 2020-02-25 Beatrice Nash Vlad Gheorghiu Michele Mosca
Fault-Tolerant Resource Estimation of Quantum Random-Access Memories 2020-01-01 Olivia Di Matteo Vlad Gheorghiu Michele Mosca
Reducing the CNOT count for Clifford+T circuits on NISQ architectures 2020-01-01 Vlad Gheorghiu Jiaxin Huang Sarah Meng Li Michele Mosca Priyanka Mukhopadhyay
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks 2020-01-01 Amelia Holcomb Geovandro C. C. F. Pereira Bhargav Das Michele Mosca
On speeding up factoring with quantum SAT solvers 2019-10-21 Michele Mosca Joao Basso Sebastian R. Verschoor
Pauli Partitioning with Respect to Gate Sets 2019-07-18 Andrew Jena Scott N. Genin Michele Mosca
Novel Technique for Robust Optimal Algorithmic Cooling 2019-06-07 Sadegh Raeisi Mária Kieferová Michele Mosca
T-Count Optimization and Reed–Muller Codes 2019-03-20 Matthew Amy Michele Mosca
Quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes 2019-02-06 Vlad Gheorghiu Michele Mosca
Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes 2019-02-06 Vlad Gheorghiu Michele Mosca
+
PSMatching: A SAS Macro for Treatment Effect Estimation and Missing Data Imputation Based on Propensity Score Matching 2019-01-01 Roberto Leombruni Michele Mosca
On speeding up factoring with quantum SAT solvers 2019-01-01 Michele Mosca Joao Basso Sebastian R. Verschoor
Pauli Partitioning with Respect to Gate Sets 2019-01-01 Andrew Jena Scott N. Genin Michele Mosca
Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes 2019-01-01 Vlad Gheorghiu Michele Mosca
Factoring semi-primes with (quantum) SAT-solvers 2019-01-01 Michele Mosca Sebastian R. Verschoor
On the controlled-NOT complexity of controlled-NOT–phase circuits 2018-08-08 Matthew Amy Parsiad Azimzadeh Michele Mosca
The Engineering of a Scalable Multi-Site Communications System Utilizing Quantum Key Distribution (QKD) 2017-11-14 Piotr K. Tysowski Xinhua Ling Norbert Lütkenhaus Michele Mosca
+
Improved reversible and quantum circuits for Karatsuba-based integer multiplication 2017-06-11 Alex Parent Martin Roetteler Michele Mosca
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3 2017-01-01 Matthew Amy Olivia Di Matteo Vlad Gheorghiu Michele Mosca Alex Parent John M. Schanck
Improved reversible and quantum circuits for Karatsuba-based integer multiplication 2017-01-01 Alex Parent Martin Roetteler Michele Mosca
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 2016-03-30 Matthew Amy Olivia Di Matteo Vlad Gheorghiu Michele Mosca Alex Parent John M. Schanck
Parallelizing quantum circuit synthesis 2016-03-01 Olivia Di Matteo Michele Mosca
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 2016-01-01 Matthew Amy Olivia Di Matteo Vlad Gheorghiu Michele Mosca Alex Parent John M. Schanck
On the robustness of bucket brigade quantum RAM 2015-12-07 Srinivasan Arunachalam Vlad Gheorghiu Tomas Jochym-O’Connor Michele Mosca Priyaa Varshinee Srinivasan
Asymptotic Bound for Heat-Bath Algorithmic Cooling 2015-03-10 Sadegh Raeisi Michele Mosca
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits 2015-03-09 Vadym Kliuchnikov Dmitri Maslov Michele Mosca
Public-key cryptography based on bounded quantum reference frames 2014-09-17 Lawrence M. Ioannou Michele Mosca
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning 2014-09-17 Matthew Amy Dmitri Maslov Michele Mosca

Commonly Cited References

Action Title Date Authors # of times referenced
Quantum algorithms revisited 1998-01-08 Richard Cleve Artur Ekert Chiara Macchiavello Michele Mosca 16
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits 2013-05-15 Matthew Amy Dmitri Maslov Michele Mosca Martin Roetteler 15
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning 2014-09-17 Matthew Amy Dmitri Maslov Michele Mosca 14
Elementary gates for quantum computation 1995-11-01 Adriano Barenco Charles H. Bennett Richard Cleve David P. DiVincenzo Norman Margolus Peter W. Shor Tycho Sleator John A. Smolin Harald Weinfurter 13
Quantum Mechanics Helps in Searching for a Needle in a Haystack 1997-07-14 Lov K. Grover 12
Strengths and Weaknesses of Quantum Computing 1997-10-01 Charles H. Bennett Ethan Bernstein Gilles Brassard Umesh Vazirani 11
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 1997-10-01 Peter W. Shor 11
Tight Bounds on Quantum Searching 1998-06-01 Michel Boyer Gilles Brassard Peter Høyer Alain Tapp 11
High-threshold universal quantum computation on the surface code 2009-11-11 Austin G. Fowler Ashley M. Stephens Peter Groszkowski 9
Quantum circuits of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>T</mml:mi></mml:math>-depth one 2013-04-01 Peter Selinger 9
Improved simulation of stabilizer circuits 2004-11-30 Scott Aaronson Daniel Gottesman 9
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 1999-01-01 Peter W. Shor 9
Engineered two-dimensional Ising interactions in a trapped-ion quantum simulator with hundreds of spins 2012-04-01 J. Britton Brian C. Sawyer Adam C. Keith C.-C. Joseph Wang J. K. Freericks Hermann Uys Michael J. Biercuk J. J. Bollinger 8
Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates 2013-05-01 Vadym Kliuchnikov Dmitri Maslov Michele Mosca 8
Quantum measurements and the Abelian Stabilizer Problem 1995-11-20 Alexei Kitaev 8
Universal quantum computation with ideal Clifford gates and noisy ancillas 2005-02-22 Sergey Bravyi Alexei Kitaev 8
Quantum Amplitude Amplification and Estimation 2000-05-15 Gilles Brassard Peter Høyer Michele Mosca Alain Tapp 7
Degradation of a quantum reference frame 2006-04-19 Stephen D. Bartlett Terry Rudolph Robert W. Spekkens Peter S. Turner 6
Towards Practical Classical Processing for the Surface Code 2012-05-01 Austin G. Fowler Adam C. Whiteside Lloyd C. L. Hollenberg 6
Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford and<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>T</mml:mi></mml:math>Circuits Using a Constant Number of Ancillary Qubits 2013-05-08 Vadym Kliuchnikov Dmitri Maslov Michele Mosca 6
On the controlled-NOT complexity of controlled-NOT–phase circuits 2018-08-08 Matthew Amy Parsiad Azimzadeh Michele Mosca 6
An exact quantum polynomial-time algorithm for Simon's problem 2002-11-22 Gilles Brassard Peter Høyer 6
Universal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction 2013-08-29 Adam Paetznick Ben W. Reichardt 6
Universal Quantum Gate Set Approaching Fault-Tolerant Thresholds with Superconducting Qubits 2012-08-09 Jerry M. Chow Jay Gambetta Antonio Córcoles Seth Merkel John A. Smolin Chad Rigetti Stefano Poletto George Keefe Mary Beth Rothwell John Rozen 5
Exact synthesis of multiqubit Clifford+<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>T</mml:mi></mml:math>circuits 2013-03-26 Brett Giles Peter Selinger 5
Quantum cryptography: a practical information security perspective 2004-01-01 Kenneth G. Paterson Fred Piper Ruediger Schack 5
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates 2012-06-22 Vadym Kliuchnikov Dmitri Maslov Michele Mosca 5
Quantum cryptography with imperfect apparatus 2002-11-27 Dominic Mayers Andrew Chi-Chih Yao 5
Single-qubit-gate error below<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msup><mml:mn mathvariant="bold">10</mml:mn><mml:mrow><mml:mo>−</mml:mo><mml:mn mathvariant="bold">4</mml:mn></mml:mrow></mml:msup></mml:math>in a trapped ion 2011-09-14 Kenneth R. Brown A. C. Wilson Yves Colombe C. Ospelkaus Adam M. Meier Emanuel Knill D. Leibfried D. J. Wineland 5
Superconducting qubit in a waveguide cavity with a coherence time approaching 0.1 ms 2012-09-24 Chad Rigetti Jay Gambetta Stefano Poletto B. L. T. Plourde Jerry M. Chow Antonio Córcoles John A. Smolin Seth Merkel John Rozen George Keefe 5
Experimental realization of a quantum algorithm 1998-05-01 Isaac L. Chuang L. M. K. Vandersypen Xinlan Zhou Debbie Leung Seth Lloyd 5
Efficient Clifford+T approximation of single-qubit operators 2015-01-01 Peter Selinger 5
Quantum Teleportation is a Universal Computational Primitive 1999-08-02 Daniel Gottesman Isaac L. Chuang 5
Optimal phase estimation in quantum networks 2007-06-27 Wim van Dam Giacomo Mauro D’Ariano Artur Ekert Chiara Macchiavello Michele Mosca 4
Parallelizing quantum circuit synthesis 2016-03-01 Olivia Di Matteo Michele Mosca 4
Analysis of Boolean Functions 2014-06-05 Ryan O’Donnell 4
Analog analogue of a digital quantum computation 1998-04-01 Edward Farhi Sam Gutmann 4
A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability 2000-01-01 Edward Farhi Jeffrey Goldstone Sam Gutmann 4
Quantum Networks for Generating Arbitrary Quantum States 2001-01-01 Michele Mosca Phillip Kaye 4
CNOT circuit extraction for topologically-constrained quantum memories 2020-06-01 Aleks Kissinger Arianne Meijer van de Griend 4
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem 2005-01-01 Greg Kuperberg 4
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices 2019-04-04 Gushu Li Yufei Ding Yuan Xie 4
The Heisenberg Representation of Quantum Computers 1998-07-01 Daniel Gottesman 4
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol 2000-07-10 Peter W. Shor John Preskill 4
Implementation of a quantum search algorithm on a quantum computer 1998-05-01 Jonathan A. Jones Michele Mosca Rasmus Hvass Hansen 4
Quantum measurements and the Abelian Stabilizer Problem 1995-01-01 Alexei Kitaev 4
+
The Case for Quantum Key Distribution 2010-01-01 Douglas Stebila Michele Mosca Norbert Lütkenhaus 4
Fault-tolerant quantum computation by anyons 2003-01-01 Alexei Kitaev 4
Authentication of quantum messages 2003-06-26 Howard Barnum Claude Crépeau Daniel Gottesman Adam Smith Alain Tapp 4
Surface codes: Towards practical large-scale quantum computation 2012-09-18 Austin G. Fowler M. Mariantoni John M. Martinis A. N. Cleland 4