Minimum synthesis cost of CNOT circuits

DOI10.1007/S11128-025-04831-5MaRDI QIDQ6934633zbMATH OpenFDO

Authors Alan Bu, Evan Fan, Robert Sanghyeon Joo

Publication date 3 September 2025

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-025-04831-5

zbMATH Keywords

circuit optimizationCNOT circuitsgraph theorylinear algebra

Mathematics Subject Classification ID

Quantum gates (81P65) Quantum computation (81P68)

Cites work

• Faster matrix multiplication via asymmetric hashing
• On the (non) \(\mathsf{NP}\)-hardness of computing circuit complexity
• Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
• Parallel quantum computation and quantum codes
• Quantum circuits of \texttt{CNOT} gates: optimization and entanglement
• The magic of universal quantum computing with permutations
• The Transitive Reduction of a Directed Graph

This page was built for publication: Minimum synthesis cost of CNOT circuits

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