559 citations · 7k across the 99 of their papers we have counts for
39 papers · 1 filter
High-threshold and low-overhead fault-tolerant quantum memory
Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta +3
Quantum error correction becomes a practical possibility only if the physical error rate is below a threshold value that depends on a particular quantum code, syndrome measurement…
CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate
Dmitri Maslov, Willers Yang
A Hadamard-free Clifford transformation is a circuit composed of quantum Phase (P), CZ, and CNOT gates. It is known that such a circuit can be written as a three-stage computation,…
Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions
Sergey Bravyi, Dmitri Maslov, Yunseong Nam
We consider quantum circuits composed of single-qubit operations and global entangling gates generated by Ising-type Hamiltonians. It is shown that such circuits can implement a la…
Depth optimization of CZ, CNOT, and Clifford circuits
Dmitri Maslov, Ben Zindorf
We seek to develop better upper bound guarantees on the depth of quantum CZ gate, CNOT gate, and Clifford circuits than those reported previously. We focus on the number of qubits…
Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
Sergey Bravyi, Ruslan Shaydulin, Shaohan Hu +1
The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction…
6-qubit Optimal Clifford Circuits
Sergey Bravyi, Joseph A. Latone, Dmitri Maslov
Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomiz…
Quantum advantage for computations with limited space
Dmitri Maslov, Jin-Sung Kim, Sergey Bravyi +2
Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provab…
Efficient ancilla-free reversible and quantum circuits for the Hidden Weighted Bit function
Sergey Bravyi, Theodore J. Yoder, Dmitri Maslov
The Hidden Weighted Bit function plays an important role in the study of classical models of computation. A common belief is that this function is exponentially hard for the implem…
Hadamard-free circuits expose the structure of the Clifford group
Sergey Bravyi, Dmitri Maslov
The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this grou…
Quantum Computer Systems for Scientific Discovery
Yuri Alexeev, Dave Bacon, Kenneth R. Brown +21
The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considere…
Ground-state energy estimation of the water molecule on a trapped ion quantum computer
Yunseong Nam, Jwo-Sy Chen, Neal C. Pisenti +23
Quantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Exam…
Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
C. Figgatt, A. Ostrander, N. M. Linke +4
The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to…
Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem
Yunseong Nam, Dmitri Maslov
We develop circuit implementations for digital-level quantum Hamiltonian dynamics simulation algorithms suitable for implementation on a reconfigurable quantum computer, such as tr…
Approximate Quantum Fourier Transform with T gates
Yunseong Nam, Yuan Su, Dmitri Maslov
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, su…
Toward the first quantum simulation with quantum speedup
Andrew M. Childs, Dmitri Maslov, Yunseong Nam +2
With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practic…
Automated optimization of large quantum circuits with continuous parameters
Yunseong Nam, Neil J. Ross, Yuan Su +2
We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to…
Use of global interactions in efficient quantum circuit constructions
Dmitri Maslov, Yunseong Nam
In this paper we study the ways to use a global entangling operator to efficiently implement circuitry common to a selection of important quantum algorithms. In particular, we focu…
Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
Dmitri Maslov, Martin Roetteler
In this paper we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in Phys. Rev. A 70(052328), 2004: to obtain a general stab…
Optimized Aaronson-Gottesman stabilizer circuit simulation through quantum circuit transformations
Dmitri Maslov
In this paper we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in {\it Phys. Rev. A 70(052328)}, 2004. In particular, we…
Experimental Comparison of Two Quantum Computing Architectures
N. M. Linke, D. Maslov, M. Roetteler +5
We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting tr…
Basic circuit compilation techniques for an ion-trap quantum machine
Dmitri Maslov
We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped at…
Optimal and asymptotically optimal NCT reversible circuits by the gate types
Dmitri Maslov
We report optimal and asymptotically optimal reversible circuits composed of NOT, CNOT, and Toffoli (NCT) gates, keeping the count by the subsets of the gate types used. This study…
On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
Dmitri Maslov
Various implementations of the Toffoli gate up to a relative phase have been known for years. The advantage over regular Toffoli gate is their smaller circuit size. However, their…
Optimization of Clifford Circuits
Vadym Kliuchnikov, Dmitri Maslov
We study optimal synthesis of Clifford circuits, and apply the results to peep-hole optimization of quantum circuits. We report optimal circuits for all Clifford operations with up…