Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2204.11635 · Scientific Reports

Universal compilation for quantum state tomography

Vu Tuan Hai, Le Bin Ho

Published Mar 6, 2023• 18 citations
arXivHTMLPDF

Abstract

Universal compilation is a training process that compiles a trainable unitary into a target unitary. It has vast potential applications from depth-circuit compressing to device benchmarking and quantum error mitigation. Here we propose a universal compilation algorithm for quantum state tomography in low-depth quantum circuits. We apply the Fubini-Study distance as a trainable cost function and employ various gradient-based optimizations. We evaluate the performance of various trainable unitary topologies and the trainability of different optimizers for getting high efficiency and reveal the crucial role of the circuit depth in robust fidelity. The results are comparable with the shadow tomography method, a similar fashion in the field. Our work expresses the adequate capability of the universal compilation algorithm to maximize the efficiency in the quantum state tomography. Further, it promises applications in quantum metrology and sensing and is applicable in the near-term quantum computers for various quantum computing tasks.

DOI
10.1038/s41598-023-30983-4

Related papers

Variational preparation of entangled states on quantum computers

Vu Tuan Hai, Nguyen Tan Viet, Le Bin Ho

We propose a variational approach for preparing entangled quantum states on quantum computers. The methodology involves training a unitary operation to match with a target unitary using the Fubini-Study distance as a cost function. We employ various gradient-based optimization techniques to enhance performance, including Adam and quantum natural gradient. Our investigation showcases the versatility of different ansatzes featuring a hypergraph structure, enabling the preparation of diverse entanglement target states such as GHZ, W, and absolutely maximally entangled states. Remarkably, the circuit depth scales efficiently with the number of layers and does not depend on the number of qubits. Moreover, we explore the impacts of barren plateaus, readout noise, and error mitigation techniques on the proposed approach. Through our analysis, we demonstrate the effectiveness of the variational algorithm in maximizing the efficiency of quantum state preparation, leveraging low-depth quantum circuits.

arXiv:2306.17422•Jun 30, 2023•16 citations

Quantum-assisted quantum compiling

Sumeet Khatri, Ryan LaRose, Alexander Poremba +3 more

Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary U and a trainable unitary V as the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlap T r ( V † U ) but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.

arXiv:1807.00800•Quantum•May 13, 2019•413 citations

Multi-target quantum compilation algorithm

Vu Tuan Hai, Nguyen Tan Viet, Jesus Urbaneja +3 more

Abstract Quantum compilation is the process of converting a target unitary operation into a trainable unitary represented by a quantum circuit. It has a wide range of applications, including gate optimization, quantum-assisted compiling, quantum state preparation, and quantum dynamic simulation. Traditional quantum compilation usually optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets, such as thermal state preparation, time-dependent dynamic simulation, and others. To address this, we develop a multi-target quantum compilation algorithm to improve the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the effectiveness of the algorithm, highlighting the importance of multi-target optimization in advancing quantum computing. This work lays the groundwork for further development and evaluation of multi-target quantum compilation algorithms.

arXiv:2407.01010•Machine Learning Science and Technology•Nov 25, 2024•7 citations

Adaptive Quantum Circuit Compilation with Bayesian Optimization

Jincheng Zhang

Quantum circuit compilation is a crucial step in the process of executing quantum algorithms on near-term quantum hardware. The challenge lies in translating high-level quantum algorithms, often expressed using universal gate sets, into efficient, gate-level circuits that minimize gate count and circuit depth, thereby reducing error rates and improving execution times. Traditional compilation methods often rely on hand-crafted heuristics or limited search algorithms, failing to fully explore the exponentially large search space of possible circuit transformations. This work proposes an adaptive quantum circuit compilation framework leveraging Bayesian optimization. The system dynamically explores the space of potential circuit transformations, learning to identify optimal compilation strategies through a probabilistic modeling approach. The core claim is that Bayesian optimization can effectively adaptively compile quantum circuits, optimizing for performance and minimizing gate count. The system incorporates a compiler that utilizes Bayesian optimization to explore the vast space of possible quantum circuit transformations, learning to identify the most efficient compilation strategies. The results demonstrate the potential of this approach to significantly reduce the complexity of quantum circuits while maintaining algorithm fidelity.

•Sep 6, 2026•0 citations

Deep Circuit Compression for Quantum Dynamics via Tensor Networks

Joe Gibbs, Łukasz Cincio

Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators for generating compressed circuits enabling real-time simulation on digital quantum computers, that for a given depth are more accurate than all Trotterizations of the same depth. By the efficient use of environment tensors, the algorithm is scalable in depth far beyond prior work, and we present circuit compilations of up to 64 layers of SU(4) gates. Surpassing only 1D circuits, our approach can flexibly target a particular quasi-2D gate topology. We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology. For all circuit depths and widths tested, we produce circuits with smaller errors than all equivalent depth Trotter unitaries, corresponding to reductions in error by up to 4 orders of magnitude and circuit depth compressions with a factor of over 6.

arXiv:2409.16361•Quantum•Jul 9, 2025•16 citations

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Tyler J. Volkoff, Zoë Holmes, Andrew T. Sornborger

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system.While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuousvariable paradigm.Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation.We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities.We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems.These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

arXiv:2105.01049•PRX Quantum•Nov 8, 2021•39 citations
Universal compilation is a training process that compiles a trainable unitary into a target unitary. It has vast potential applications from depth-circuit compressing to device benchmarking and quantum error mitigation. Here we propose a universal compilation algorithm for quantum state tomography in low-depth quantum circuits. We apply the Fubini-Study distance as a trainable cost function and employ various gradient-based optimizations. We evaluate the performance of various trainable unitary topologies and the trainability of different optimizers for getting high efficiency and reveal the crucial role of the circuit depth in robust fidelity. The results are comparable with the shadow tomography method, a similar fashion in the field. Our work expresses the adequate capability of the universal compilation algorithm to maximize the efficiency in the quantum state tomography. Further, it promises applications in quantum metrology and sensing and is applicable in the near-term quantum computers for various quantum computing tasks.
We propose a variational approach for preparing entangled quantum states on quantum computers. The methodology involves training a unitary operation to match with a target unitary using the Fubini-Study distance as a cost function. We employ various gradient-based optimization techniques to enhance performance, including Adam and quantum natural gradient. Our investigation showcases the versatility of different ansatzes featuring a hypergraph structure, enabling the preparation of diverse entanglement target states such as GHZ, W, and absolutely maximally entangled states. Remarkably, the circuit depth scales efficiently with the number of layers and does not depend on the number of qubits. Moreover, we explore the impacts of barren plateaus, readout noise, and error mitigation techniques on the proposed approach. Through our analysis, we demonstrate the effectiveness of the variational algorithm in maximizing the efficiency of quantum state preparation, leveraging low-depth quantum circuits.
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary U and a trainable unitary V as the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlap T r ( V † U ) but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.
Abstract Quantum compilation is the process of converting a target unitary operation into a trainable unitary represented by a quantum circuit. It has a wide range of applications, including gate optimization, quantum-assisted compiling, quantum state preparation, and quantum dynamic simulation. Traditional quantum compilation usually optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets, such as thermal state preparation, time-dependent dynamic simulation, and others. To address this, we develop a multi-target quantum compilation algorithm to improve the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the effectiveness of the algorithm, highlighting the importance of multi-target optimization in advancing quantum computing. This work lays the groundwork for further development and evaluation of multi-target quantum compilation algorithms.
Quantum circuit compilation is a crucial step in the process of executing quantum algorithms on near-term quantum hardware. The challenge lies in translating high-level quantum algorithms, often expressed using universal gate sets, into efficient, gate-level circuits that minimize gate count and circuit depth, thereby reducing error rates and improving execution times. Traditional compilation methods often rely on hand-crafted heuristics or limited search algorithms, failing to fully explore the exponentially large search space of possible circuit transformations. This work proposes an adaptive quantum circuit compilation framework leveraging Bayesian optimization. The system dynamically explores the space of potential circuit transformations, learning to identify optimal compilation strategies through a probabilistic modeling approach. The core claim is that Bayesian optimization can effectively adaptively compile quantum circuits, optimizing for performance and minimizing gate count. The system incorporates a compiler that utilizes Bayesian optimization to explore the vast space of possible quantum circuit transformations, learning to identify the most efficient compilation strategies. The results demonstrate the potential of this approach to significantly reduce the complexity of quantum circuits while maintaining algorithm fidelity.
Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators for generating compressed circuits enabling real-time simulation on digital quantum computers, that for a given depth are more accurate than all Trotterizations of the same depth. By the efficient use of environment tensors, the algorithm is scalable in depth far beyond prior work, and we present circuit compilations of up to 64 layers of SU(4) gates. Surpassing only 1D circuits, our approach can flexibly target a particular quasi-2D gate topology. We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology. For all circuit depths and widths tested, we produce circuits with smaller errors than all equivalent depth Trotter unitaries, corresponding to reductions in error by up to 4 orders of magnitude and circuit depth compressions with a factor of over 6.
Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system.While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuousvariable paradigm.Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation.We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities.We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems.These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.