• Publications
  • Influence
Quantum Computation and Quantum Information
Preface Acknowledgement Nomenclature and notation Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. QuantumExpand
Quantum Computation and Quantum Information (10th Anniversary edition)
TLDR
Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering. Expand
Conditions for a Class of Entanglement Transformations
Suppose Alice and Bob jointly possess a pure state, |ψ〉. Using local operations on their respective systems and classical communication it may be possible for Alice and Bob to transform |ψ〉 intoExpand
The Solovay-Kitaev algorithm
TLDR
The algorithm can be used to compile Shor's algorithm into an efficient fault-tolerant form using only Hadamard, controlled-not, and π/8 gates, and is generalized to apply to multi-qubit gates and togates from SU(d). Expand
Quantum Computation and Quantum Information Theory
A dual power and manual hydraulic brake system for a motor vehicle including a fluid pressure operated mechanism for actuating wheel brake shoes or the like, a master cylinder containing a power orExpand
Prescription for experimental determination of the dynamics of a quantum black box
Abstract We give an explicit way to experimentally determine the evolution operators which completely describe the dynamics of a quantum-mechanical black box: an arbitrary open quantum system. WeExpand
Quantum Computation and Quantum Information: Entropy and information
Entropy is a key concept of quantum information theory. It measures how much uncertainty there is in the state of a physical system. In this chapter we review the basic definitions and properties ofExpand
Quantum Computation as Geometry
TLDR
It is shown that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry, recasting the problem of finding quantum circuits as a geometric problem. Expand
A geometric approach to quantum circuit lower bounds
  • M. Nielsen
  • Mathematics, Computer Science
  • Quantum Inf. Comput.
  • 11 February 2005
TLDR
Several Finsler metrics whose minimal length geodesics provide lower bounds on quantum circuitsize are constructed and a large class of solutions to the geodesic equation, which are called Pauli geodesICS, since they arise from isometries generated by the Pauli group. Expand
Programmable Quantum Gate Arrays
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that aExpand
...
1
2
3
4
5
...