activity
20132024
most citedToward the first quantum simulation with quantum speedup

559 citations · 1.1k across the 21 of their papers we have counts for

collaborators

22 papers

cs.LO2024

Proto-Quipper with Reversing and Control

Peng Fu, Kohei Kishida, Neil J. Ross +1

The quantum programming language Quipper supports circuit operations such as reversing and controlling certain quantum circuits. Additionally, Quipper provides a function called wi…

quant-ph2023

Improved Synthesis of Toffoli-Hadamard Circuits

Matthew Amy, Andrew N. Glaudell, Sarah Meng Li +1

The matrices that can be exactly represented by a circuit over the Toffoli-Hadamard gate set are the orthogonal matrices of the form , where is an integer matr…

math.CT2022

On the Lambek embedding and the category of product-preserving presheaves

Peng Fu, Kohei Kishida, Neil J. Ross +1

It is well-known that the category of presheaf functors is complete and cocomplete, and that the Yoneda embedding into the presheaf category preserves products. However, the Yoneda…

quant-ph2022★ 5 cited

Symbolic Synthesis of Clifford Circuits and Beyond

Matthew Amy, Owen Bennett-Gibbs, Neil J. Ross

Path sums are a convenient symbolic formalism for quantum operations with applications to the simulation, optimization, and verification of quantum protocols. Unlike quantum circui…

cs.PL2022★ 1 cited

Proto-Quipper with dynamic lifting

Peng Fu, Kohei Kishida, Neil J. Ross +1

Quipper is a functional programming language for quantum computing. Proto-Quipper is a family of languages aiming to provide a formal foundation for Quipper. In this paper, we exte…

cs.PL2022★ 3 cited

A Biset-Enriched Categorical Model for Proto-Quipper with Dynamic Lifting

Peng Fu, Kohei Kishida, Neil J. Ross +1

Quipper and Proto-Quipper are a family of quantum programming languages that, by their nature as circuit description languages, involve two runtimes: one at which the program gener…

quant-ph2022★ 1 cited

Qutrit metaplectic gates are a subset of Clifford+T

Andrew Glaudell, Neil J. Ross, John van de Wetering +1

A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily implemented on many fault-tolerant architectures. For qutrits, there is an equi…

quant-ph2021★ 5 cited

Generators and Relations for Real Stabilizer Operators

Justin Makary, Neil J. Ross, Peter Selinger

Real stabilizer operators, which are also known as real Clifford operators, are generated, through composition and tensor product, by the Hadamard gate, the Pauli Z gate, and the c…

quant-ph2021★ 4 cited

Generators and Relations for the Group On(Z[1/2])

Sarah Meng Li, Neil J. Ross, Peter Selinger

We give a finite presentation by generators and relations for the group O_n(Z[1/2]) of n-dimensional orthogonal matrices with entries in Z[1/2]. We then obtain a similar presentati…

quant-ph2021★ 10 cited

The phase/state duality in reversible circuit design

Matthew Amy, Neil J. Ross

The reversible implementation of classical functions accounts for the bulk of most known quantum algorithms. As a result, a number of reversible circuit constructions over the Clif…

cs.PL2020★ 18 cited

A tutorial introduction to quantum circuit programming in dependently typed Proto-Quipper

Peng Fu, Kohei Kishida, Neil J. Ross +1

We introduce dependently typed Proto-Quipper, or Proto-Quipper-D for short, an experimental quantum circuit programming language with linear dependent types. We give several exampl…

quant-ph2020

Optimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation

Andrew N. Glaudell, Neil J. Ross, Jacob M. Taylor

We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlled-phase gate CS=diag(1,1,1,i). The Clifford+CS gate set i…

quant-ph2019★ 26 cited

Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits

Matthew Amy, Andrew N. Glaudell, Neil J. Ross

Kliuchnikov, Maslov, and Mosca proved in 2012 that a unitary matrix can be exactly represented by a single-qubit Clifford+ circuit if and only if the entries of…

quant-ph2017★ 559 cited

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…

quant-ph2017★ 223 cited

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…

quant-ph2017★ 1 cited

Graphical Methods in Device-Independent Quantum Cryptography

Spencer Breiner, Carl A. Miller, Neil J. Ross

We introduce a framework for graphical security proofs in device-independent quantum cryptography using the methods of categorical quantum mechanics. We are optimistic that this ap…

quant-ph2017★ 18 cited

A Finite Presentation of CNOT-Dihedral Operators

Matthew Amy, Jianxin Chen, Neil J. Ross

We give a finite presentation by generators and relations of the unitary operators expressible over the {CNOT, T, X} gate set, also known as CNOT-dihedral operators. To this end, w…

quant-ph2015

Algebraic and Logical Methods in Quantum Computation

Neil J. Ross

This thesis contains contributions to the theory of quantum computation. We first define a new method to efficiently approximate special unitary operators. Specifically, given a sp…

cs.PL2014★ 9 cited

Quipper: Concrete Resource Estimation in Quantum Algorithms

Jonathan M. Smith, Neil J. Ross, Peter Selinger +1

Despite the rich literature on quantum algorithms, there is a surprisingly small amount of coverage of their concrete logical design and implementation. Most resource estimation is…

quant-ph2014★ 2 cited

Optimal ancilla-free Clifford+V approximation of z-rotations

Neil J. Ross

We describe a new efficient algorithm to approximate z-rotations by ancilla-free Clifford+V circuits, up to a given precision epsilon. Our algorithm is optimal in the presence of a…

cs.PL2013★ 78 cited

An Introduction to Quantum Programming in Quipper

Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross +2

Quipper is a recently developed programming language for expressing quantum computations. This paper gives a brief tutorial introduction to the language, through a demonstration of…

cs.PL2013★ 137 cited

Quipper: A Scalable Quantum Programming Language

Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross +2

The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the…