scientific article; zbMATH DE number 7651038

DOI10.4230/LIPICS.TQC.2020.11MaRDI QIDQ5874396zbMATH OpenFDO

Authors Niel de Beaudrap, Xiaoning Bian, Quanlong Wang

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2004.05164

zbMATH Keywords

T-countZX calculusClifford hierarchyparity-phase operationsphase gadgets

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Mapping NCV Circuits to Optimized Clifford+T Circuits
• Quantum circuit optimization by Hadamard gate reduction
• SAT-based {CNOT, \(T\)} quantum circuit synthesis
• Advanced exact synthesis of Clifford+T circuits
• Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity

Cited in

(9)

• Quantum algorithms and oracles with the scalable ZX-calculus
• The structure of sum-over-paths, its consequences, and completeness for Clifford
• Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
• Picturing Counting Reductions with the ZH-Calculus
• The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
• And-gates in ZX-calculus: spider nest identities and QBC-completeness
• An algebraic axiomatisation of ZX-calculus
• Generators and relations for \(U_n(\mathbb{Z}[\frac{1}{2}, i])\)
• Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874396)