1.4k citations · 6.8k across the 59 of their papers we have counts for
61 papers
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…
T-count and T-depth of any multi-qubit unitary
Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay
While implementing a quantum algorithm it is crucial to reduce the quantum resources, in order to obtain the desired computational advantage. For most fault-tolerant quantum error-…
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay
We investigate the problem of synthesizing T-depth optimal quantum circuits over the Clifford+T gate set. First we construct a special subset of T-depth 1 unitaries, such that it i…
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…
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks
Amelia Holcomb, Geovandro C. C. F. Pereira, Bhargav Das +1
Hyperledger Fabric is a prominent and flexible solution for building permissioned distributed ledger platforms. Access control and identity management relies on a Membership Servic…
A polynomial time and space heuristic algorithm for T-count
Michele Mosca, Priyanka Mukhopadhyay
This work focuses on reducing the physical cost of implementing quantum algorithms when using the state-of-the-art fault-tolerant quantum error correcting codes, in particular, tho…