aiqbench analysis
This research demonstrates that parallel quantum circuit architectures can achieve near-optimal query complexity for unitary process tomography, effectively closing the efficiency gap with sequential methods up to a logarithmic factor. By introducing an explicit parallel procedure, the study confirms that both architectural strategies are nearly equally capable for characterizing unknown quantum gates in diamond distance. This advancement is critical for optimizing resource usage and scaling error characterization protocols in practical quantum computing implementations.
Near-Optimal Parallel Unitary Process Tomography in Diamond Distance
arXiv:2609.36127v1 Announce Type: new Abstract: Unitary process tomography is the act of learning how an unknown unitary gate acts on a quantum system. It is an essential procedure for realizing a functioning quantum computer. As quantum technologies develop, it is important to understand the computational resources needed to conduct unitary process tomography using a variety of types of circuits. In particular, when measuring error in diamond distance, it is known how to achieve optimal query complexity using a sequential circuit architecture, but it had not been known whether a parallel circuit architecture could achieve the same optimal query complexity. In this work, we prove that unitary process tomography with near-optimal query complexity is indeed possible using a parallel circuit by introducing an explicit, novel parallel procedure. This closes the gap between sequential and parallel circuits up to a logarithmic factor, showing that parallel and sequential strategies are nearly equally capable for this task.
Abstract:Unitary process tomography is the act of learning how an unknown unitary gate acts on a quantum system. It is an essential procedure for realizing a functioning quantum computer. As quantum technologies develop, it is important to understand the computational resources needed to conduct unitary process tomography using a variety of types of circuits. In particular, when measuring error in diamond distance, it is known how to achieve optimal query complexity using a sequential circuit architecture, but it had not been known whether a parallel circuit architecture could achieve the same optimal query complexity. In this work, we prove that unitary process tomography with near-optimal query complexity is indeed possible using a parallel circuit by introducing an explicit, novel parallel procedure. This closes the gap between sequential and parallel circuits up to a logarithmic factor, showing that parallel and sequential strategies are nearly equally capable for this task.
arXiv:2609.36127 [quant-ph]
(or arXiv:2609.36127v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.36127 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 239 words
Related coverage
Optimal learning of quantum channels in diamond distance
arXiv · Jun 16, 2026
Query-optimal unitary channel tomography in diamond distance with parallel access
arXiv · Sep 30, 2026

News
Quantum Computing Report · Jul 25, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026