activity
20202026
most citedReducing the CNOT count for Clifford+T circuits on NISQ architectures

26 citations · 46 across the 8 of their papers we have counts for

collaborators

10 papers

quant-ph2026

SpiderCSS: Scalable Fault-Tolerant CSS State Preparation

Boldizsár Poór, Andrey Boris Khesin, Sarah Meng Li +3

Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing. This paper introduces SpiderCSS, a scalabl…

quant-ph2026

A Complete and Natural Rule Set for Multi-Qudit Clifford Circuits in All Odd Prime Dimensions

Xiaoning Bian, Sarah Meng Li, Neil J. Ross +2

We present a complete set of rewrite rules for multi-qudit Clifford circuits in all odd prime dimensions. Completeness means that any two Clifford circuits representing the sa…

quant-ph2026★ 1 cited

SpiderCat: Optimal Fault-Tolerant Cat State Preparation

Andrey Boris Khesin, Sarah Meng Li, Boldizsár Poór +3

The ability to fault-tolerantly prepare CAT states, also known as multi-qubit GHZ states, is an important primitive for quantum error correction. It is required for Shor-style synd…

cs.LO2025★ 2 cited

A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits

Sarah Meng Li, Michele Mosca, Neil J. Ross +2

We present a complete set of rewrite rules for n-qutrit Clifford circuits where n is any non-negative integer. This is the first completeness result for any fragment of quantum cir…

quant-ph2024

Improving the Fidelity of CNOT Circuits on NISQ Hardware

Dohun Kim, Minyoung Kim, Sarah Meng Li +1

We introduce an improved CNOT synthesis algorithm that considers nearest-neighbour interactions and CNOT gate error rates in noisy intermediate-scale quantum (NISQ) hardware. Compa…

quant-ph2023★ 7 cited

Graphical CSS Code Transformation Using ZX Calculus

Jiaxin Huang, Sarah Meng Li, Lia Yeh +3

In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic…

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…

quant-ph2022★ 6 cited

Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation

Arianne Meijer-van de Griend, Sarah Meng Li

Many quantum computers have constraints regarding which two-qubit operations are locally allowed. To run a quantum circuit under those constraints, qubits need to be mapped to diff…

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-ph2020★ 26 cited

Reducing the CNOT count for Clifford+T circuits on NISQ architectures

Vlad Gheorghiu, Jiaxin Huang, Sarah Meng Li +2

While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture. Connectivity of the physical qub…