NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (45)

quant-ph2012

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

Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca

quant-ph2000

Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates

Wim van Dam, Frederic Magniez, Michele Mosca +1

quant-ph2008

Simulating quantum systems using real Hilbert spaces

Matthew McKague, Michele Mosca, Nicolas Gisin

quant-ph2019

Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes

Vlad Gheorghiu, Michele Mosca

quant-ph2018

T-count optimization and Reed-Muller codes

Matthew Amy, Michele Mosca

quant-ph2011

Unconditionally-secure and reusable public-key authentication

Lawrence M. Ioannou, Michele Mosca

quant-ph2008

Quantum Algorithms

Michele Mosca

cs.CR2017

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

Piotr K. Tysowski, Xinhua Ling, Norbert Lütkenhaus +1

quant-ph2010

Algorithms for Quantum Computers

Jamie Smith, Michele Mosca

quant-ph2001

Quantum Networks for Concentrating Entanglement

Phillip Kaye, Michele Mosca

quant-ph2000

Private Quantum Channels and the Cost of Randomizing Quantum Information

Michele Mosca, Alain Tapp, Ronald de Wolf

quant-ph2018

On the CNOT-complexity of CNOT-PHASE circuits

Matthew Amy, Parsiad Azimzadeh, Michele Mosca

quant-ph2010

Generalized self-testing and the security of the 6-state protocol

Matthew McKague, Michele Mosca

cs.CR2013

Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search

Thijs Laarhoven, Michele Mosca, Joop van de Pol

quant-ph2006

Single spin measurement using cellular automata techniques

Carlos A. Perez-Delgado, Michele Mosca, Paola Cappellaro +1

quant-ph2016

Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3

Matthew Amy, Olivia Di Matteo, Vlad Gheorghiu +3

quant-ph2014

The Asymptotic Cooling of Heat-Bath Algorithmic Cooling

Sadegh Raeisi, Michele Mosca

quant-ph2009

The Case for Quantum Key Distribution

Douglas Stebila, Michele Mosca, Norbert Lütkenhaus

quant-ph2009

Interacting boson problems are QMA-hard

Tzu-Chieh Wei, Michele Mosca, Ashwin Nayak

quant-ph2019

Pauli Partitioning with Respect to Gate Sets

Andrew Jena, Scott Genin, Michele Mosca

quant-ph2013

Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates

Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca

quant-ph2002

How Powerful is Adiabatic Quantum Computation?

Wim van Dam, Michele Mosca, Umesh Vazirani

quant-ph1999

The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer

Michele Mosca, Artur Ekert

quant-ph2013

Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning

Matthew Amy, Dmitri Maslov, Michele Mosca

quant-ph2015

On the robustness of bucket brigade quantum RAM

Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor +2

quant-ph2009

Quantum Coins

Michele Mosca, Douglas Stebila

quant-ph2005

Self-Testing of Quantum Circuits

Frederic Magniez, Dominic Mayers, Michele Mosca +1

cs.DS2001

Decomposing Finite Abelian Groups

Kevin K. H. Cheung, Michele Mosca

quant-ph2012

Quantum Key Distribution in the Classical Authenticated Key Exchange Framework

Michele Mosca, Douglas Stebila, Berkant Ustaoglu

quant-ph1997

Quantum Algorithms Revisited

Richard Cleve, Artur Ekert, Chiara Macchiavello +1

quant-ph2003

Exact quantum Fourier transforms and discrete logarithm algorithms

Michele Mosca, Christof Zalka

quant-ph2019

Novel Technique for Robust Optimal Algorithmic Cooling

Sadegh Raeisi, Mária Kieferová, Michele Mosca

quant-ph2007

Optimal phase estimation in quantum networks

Wim van Dam, G. Mauro D'Ariano, Artur Ekert +2

quant-ph2016

Parallelizing quantum circuit synthesis

Olivia Di Matteo, Michele Mosca

quant-ph2011

A new spin on quantum cryptography: Avoiding trapdoors and embracing public keys

Lawrence M. Ioannou, Michele Mosca

quant-ph2013

A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits

Matthew Amy, Dmitri Maslov, Michele Mosca +1

quant-ph2010

Universal quantum computation in a hidden basis

Lawrence M. Ioannou, Michele Mosca

quant-ph2017

Improved reversible and quantum circuits for Karatsuba-based integer multiplication

Alex Parent, Martin Roetteler, Michele Mosca

quant-ph2013

An algorithm for the T-count

David Gosset, Vadym Kliuchnikov, Michele Mosca +1

quant-ph2004

Quantum Networks for Generating Arbitrary Quantum States

Phillip Kaye, Michele Mosca

quant-ph2011

Public-key cryptography based on bounded quantum reference frames

Lawrence M. Ioannou, Michele Mosca

quant-ph2003

Quantum Search on Bounded-Error Inputs

Peter Hoyer, Michele Mosca, Ronald de Wolf

quant-ph1998

Quantum Lower Bounds by Polynomials

Robert Beals, Harry Buhrman, Richard Cleve +2

quant-ph2008

Limitations of some simple adiabatic quantum algorithms

Lawrence M. Ioannou, Michele Mosca

quant-ph2014

Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits

Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca