• Publications
  • Influence
Quantum Amplitude Amplification and Estimation
Consider a Boolean function $\chi: X \to \{0,1\}$ that partitions set $X$ between its good and bad elements, where $x$ is good if $\chi(x)=1$ and bad otherwise. Consider also a quantum algorithmExpand
Quantum algorithms revisited
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantumExpand
An Introduction to Quantum Computing
Preface 1. Introduction and background 2. Linear algebra and the Dirac notation 3. Qubits and the framework of quantum mechanics 4. A quantum model of computation 5. Superdense coding and quantum teleportation 6. Introductory quantum algorithms. Expand
Quantum lower bounds by polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model. Expand
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speedup over simple brute force algorithms. Expand
Quantum lower bounds by polynomials
We examine the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model. Expand
How powerful is adiabatic quantum computation?
The authors analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'. Expand
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
  • M. Amy, D. Maslov, M. Mosca
  • Mathematics, Computer Science
  • IEEE Transactions on Computer-Aided Design of…
  • 8 March 2013
A polynomial-time algorithm for optimizing quantum circuits composed of Clifford group and T gates, the latter being typically the most costly gate in fault-tolerant models, with the purpose of minimizing both T-count and T-depth. Expand
Private quantum channels
We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. Expand
Quantum Search on Bounded-Error Inputs
We describe a quantum algorithm that uses O(√n) repetitions of the base algorithms and with high probability finds the index of a 1-bit among these n bits (if there is such an index). Expand