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

Explainable AI for Quantum Circuit Optimization using Tensor Networks

Jincheng Zhang

Published Aug 28, 2026• 0 citations
Publisher

Abstract

Quantum circuit optimization is crucial for realizing the full potential of quantum computing, but current optimization techniques often operate as black boxes, lacking transparency and hindering trust. This paper proposes a novel approach combining tensor networks with explainable AI to address this challenge. We represent quantum circuits using tensor networks, allowing for a richer mathematical representation and facilitating the application of explainable AI methods. The developed system generates visualizations and textual explanations detailing the key factors driving optimization decisions, promoting understanding and trust in the process. The core claim highlights the critical need for explainability in AI-driven optimization, while the proposed mechanism leverages tensor networks to achieve this. We demonstrate the potential of this combined approach to enhance transparency and accelerate the adoption of quantum circuit optimization techniques. This work introduces a new paradigm for quantum optimization, moving beyond opaque algorithms towards interpretable and trustworthy solutions.

DOI
10.5281/zenodo.22139273

Related papers

Relational Quantum Circuit Synthesis via Tensor Network Optimization

Jincheng Zhang

The synthesis of efficient quantum circuits for complex computations remains a significant challenge in quantum computing. Traditional methods often struggle with the exponential growth of the solution space, particularly as the number of qubits increases. This work introduces a novel approach to quantum circuit synthesis leveraging tensor network optimization. We represent quantum circuits as tensor networks and employ techniques such as Tensor Train and Product Tensor Decomposition to efficiently approximate the optimal circuit topology. A quantum-inspired probabilistic sampling strategy is then integrated to explore the solution space effectively. The core claim is that optimizing quantum circuit synthesis for complex systems is intrinsically intractable using conventional methods. This approach offers a potentially scalable alternative, providing a pathway toward designing practical quantum circuits for a wider range of applications. The method is presented with a focus on the mathematical formalism and optimization techniques involved.

•Aug 28, 2026•0 citations

Formal Specification of Quantum Algorithms via Tensor Networks

Jincheng Zhang

Quantum algorithms offer the potential for exponential speedups over classical algorithms for specific computational tasks. However, the inherent complexity and probabilistic nature of quantum mechanics pose significant challenges in verifying and understanding these algorithms. Traditional approaches, relying on simulations and theoretical arguments, often struggle to provide definitive proof of correctness and to guide the optimization of quantum circuits. This paper proposes a novel approach to formally specifying quantum algorithms by representing them using tensor networks. Tensor networks provide a powerful mathematical framework for describing multi-dimensional quantum states and operations, allowing for a precise and rigorous description of the algorithm's evolution. We demonstrate how tensor network techniques can be used to capture the unitary transformations that constitute a quantum algorithm, providing a foundation for automated verification and optimization strategies. The key contribution of this work is the application of tensor networks to the formal specification of quantum algorithms, addressing a critical gap in the field and paving the way for more robust and reliable quantum computation. The formal specification allows for the definition of the algorithm's state space and the evolution operator, enabling the application of mathematical techniques to analyze and improve the algorithm's performance.

•Aug 31, 2026•0 citations

Relational Quantum Circuit Compilation via Tensor Networks

Jincheng Zhang

Quantum circuit compilation is a critical step in realizing quantum computation, aiming to translate high-level quantum algorithms into a sequence of low-level gate operations executable on a quantum hardware. Traditional compilation methods often suffer from exponential scaling in the representation of the quantum state space, leading to prohibitive computational costs. This work introduces a novel approach to quantum circuit compilation utilizing tensor networks. We represent quantum circuits and their resulting states as higher-order tensor networks, enabling efficient manipulation and contraction of these representations. Our algorithm leverages tensor contraction and permutation techniques specifically tailored to the inherent structure of quantum circuits, minimizing the rank of the tensor networks and, consequently, reducing computational overhead. This approach offers the potential for significant speedups compared to conventional compilation techniques, addressing the core challenge of exponential scaling in quantum state representation. The method's effectiveness is demonstrated through theoretical analysis and a novel compilation algorithm.

•Sep 3, 2026•0 citations

Dynamic Quantum Circuit Compilation via Tensor Networks

Jincheng Zhang

Quantum circuit compilation is a crucial step in realizing quantum algorithms on near-term quantum hardware. Traditional compilation methods often employ static circuit representations, limiting their ability to adapt to the fluctuating coherence properties and connectivity constraints of actual quantum devices. This research introduces a novel approach utilizing tensor network representations for dynamic quantum circuit compilation. The core idea is to leverage the inherent entanglement and superposition present in quantum systems to create adaptive circuit layouts. Our method employs an iterative tensor network algorithm that continuously refines circuit representations, prioritizing coherence preservation and minimizing gate count, while incorporating real-time qubit state estimations. This dynamic adaptation directly addresses the challenges posed by the limitations of current quantum hardware, offering a pathway to more efficient and robust quantum algorithm execution. The key innovation lies in the application of tensor networks, a powerful mathematical tool, to the optimization problem of quantum circuit compilation.

•Sep 4, 2026•0 citations

Towards Explainability of Classical Neural Network via Quantum Computing

Junyong Lee, Jeihee Cho, Daniel Justice +1 more

In recent years, machine learning has achieved remarkable success in tasks such as image classification and solving complex real-world problems. The achievements of deep neural networks (DNNs) have led to the widespread adoption of block-based architectures. However, as the demand for Explainable AI (XAI) grows, there is a need for models that provide greater transparency and interpretability. Our work addresses this need by exploring the potential of quantum-classical hybrid models. By integrating classical neural networks (ClaNNs) with quantum neural networks (QNNs), we aim to develop AI systems that are not only powerful but also interpretable. We propose a framework that combines parameterized quantum circuits (PQCs) with classical layers to create a hybrid block design for QNNs. By adding a linear layer after the PQCs, the flexibility of the block design is increased. This architecture enhances the adaptability of QNN design and facilitates the integration of XAI principles through the comparison of the loss function planes. Our training method, inspired by knowledge distillation, addresses existing challenges in PQC-based QNN designs, providing insights into the optimization landscape. We validate the effectiveness of our hybrid block through experiments on standard datasets, demonstrating its potential to achieve comparable accuracy to traditional DNNs while providing improved interpretability.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2024•2 citations

Generative Adversarial Networks for Quantum Circuit Optimization

Jincheng Zhang

Quantum circuit optimization is a critical challenge in the development and deployment of quantum computers. The complexity of optimizing large quantum circuits grows exponentially with circuit size, making traditional methods computationally prohibitive. This work proposes a novel approach utilizing Generative Adversarial Networks (GANs) to address this problem. The core idea is to train a GAN to learn a compressed, lower-dimensional representation of quantum circuits. This representation can then be used to efficiently guide the optimization process using gradient-based methods. We demonstrate, theoretically, that the GAN's ability to learn complex mappings from high-dimensional space to lower-dimensional space can significantly accelerate the optimization process compared to conventional techniques. The key formulation involves a generator network, G(s), which maps a quantum circuit (s) to a lower-dimensional latent space, and a discriminator network, D(z), which distinguishes between real and generated latent representations. The optimization process hinges on the adversarial training between G and D. We present a framework for this process, outlining the mathematical foundations and potential advantages. This work lays the groundwork for future research exploring GANs as a powerful tool for quantum circuit optimization.

•Aug 28, 2026•0 citations
Quantum circuit optimization is crucial for realizing the full potential of quantum computing, but current optimization techniques often operate as black boxes, lacking transparency and hindering trust. This paper proposes a novel approach combining tensor networks with explainable AI to address this challenge. We represent quantum circuits using tensor networks, allowing for a richer mathematical representation and facilitating the application of explainable AI methods. The developed system generates visualizations and textual explanations detailing the key factors driving optimization decisions, promoting understanding and trust in the process. The core claim highlights the critical need for explainability in AI-driven optimization, while the proposed mechanism leverages tensor networks to achieve this. We demonstrate the potential of this combined approach to enhance transparency and accelerate the adoption of quantum circuit optimization techniques. This work introduces a new paradigm for quantum optimization, moving beyond opaque algorithms towards interpretable and trustworthy solutions.
The synthesis of efficient quantum circuits for complex computations remains a significant challenge in quantum computing. Traditional methods often struggle with the exponential growth of the solution space, particularly as the number of qubits increases. This work introduces a novel approach to quantum circuit synthesis leveraging tensor network optimization. We represent quantum circuits as tensor networks and employ techniques such as Tensor Train and Product Tensor Decomposition to efficiently approximate the optimal circuit topology. A quantum-inspired probabilistic sampling strategy is then integrated to explore the solution space effectively. The core claim is that optimizing quantum circuit synthesis for complex systems is intrinsically intractable using conventional methods. This approach offers a potentially scalable alternative, providing a pathway toward designing practical quantum circuits for a wider range of applications. The method is presented with a focus on the mathematical formalism and optimization techniques involved.
Quantum algorithms offer the potential for exponential speedups over classical algorithms for specific computational tasks. However, the inherent complexity and probabilistic nature of quantum mechanics pose significant challenges in verifying and understanding these algorithms. Traditional approaches, relying on simulations and theoretical arguments, often struggle to provide definitive proof of correctness and to guide the optimization of quantum circuits. This paper proposes a novel approach to formally specifying quantum algorithms by representing them using tensor networks. Tensor networks provide a powerful mathematical framework for describing multi-dimensional quantum states and operations, allowing for a precise and rigorous description of the algorithm's evolution. We demonstrate how tensor network techniques can be used to capture the unitary transformations that constitute a quantum algorithm, providing a foundation for automated verification and optimization strategies. The key contribution of this work is the application of tensor networks to the formal specification of quantum algorithms, addressing a critical gap in the field and paving the way for more robust and reliable quantum computation. The formal specification allows for the definition of the algorithm's state space and the evolution operator, enabling the application of mathematical techniques to analyze and improve the algorithm's performance.
Quantum circuit compilation is a critical step in realizing quantum computation, aiming to translate high-level quantum algorithms into a sequence of low-level gate operations executable on a quantum hardware. Traditional compilation methods often suffer from exponential scaling in the representation of the quantum state space, leading to prohibitive computational costs. This work introduces a novel approach to quantum circuit compilation utilizing tensor networks. We represent quantum circuits and their resulting states as higher-order tensor networks, enabling efficient manipulation and contraction of these representations. Our algorithm leverages tensor contraction and permutation techniques specifically tailored to the inherent structure of quantum circuits, minimizing the rank of the tensor networks and, consequently, reducing computational overhead. This approach offers the potential for significant speedups compared to conventional compilation techniques, addressing the core challenge of exponential scaling in quantum state representation. The method's effectiveness is demonstrated through theoretical analysis and a novel compilation algorithm.
Quantum circuit compilation is a crucial step in realizing quantum algorithms on near-term quantum hardware. Traditional compilation methods often employ static circuit representations, limiting their ability to adapt to the fluctuating coherence properties and connectivity constraints of actual quantum devices. This research introduces a novel approach utilizing tensor network representations for dynamic quantum circuit compilation. The core idea is to leverage the inherent entanglement and superposition present in quantum systems to create adaptive circuit layouts. Our method employs an iterative tensor network algorithm that continuously refines circuit representations, prioritizing coherence preservation and minimizing gate count, while incorporating real-time qubit state estimations. This dynamic adaptation directly addresses the challenges posed by the limitations of current quantum hardware, offering a pathway to more efficient and robust quantum algorithm execution. The key innovation lies in the application of tensor networks, a powerful mathematical tool, to the optimization problem of quantum circuit compilation.
In recent years, machine learning has achieved remarkable success in tasks such as image classification and solving complex real-world problems. The achievements of deep neural networks (DNNs) have led to the widespread adoption of block-based architectures. However, as the demand for Explainable AI (XAI) grows, there is a need for models that provide greater transparency and interpretability. Our work addresses this need by exploring the potential of quantum-classical hybrid models. By integrating classical neural networks (ClaNNs) with quantum neural networks (QNNs), we aim to develop AI systems that are not only powerful but also interpretable. We propose a framework that combines parameterized quantum circuits (PQCs) with classical layers to create a hybrid block design for QNNs. By adding a linear layer after the PQCs, the flexibility of the block design is increased. This architecture enhances the adaptability of QNN design and facilitates the integration of XAI principles through the comparison of the loss function planes. Our training method, inspired by knowledge distillation, addresses existing challenges in PQC-based QNN designs, providing insights into the optimization landscape. We validate the effectiveness of our hybrid block through experiments on standard datasets, demonstrating its potential to achieve comparable accuracy to traditional DNNs while providing improved interpretability.
Quantum circuit optimization is a critical challenge in the development and deployment of quantum computers. The complexity of optimizing large quantum circuits grows exponentially with circuit size, making traditional methods computationally prohibitive. This work proposes a novel approach utilizing Generative Adversarial Networks (GANs) to address this problem. The core idea is to train a GAN to learn a compressed, lower-dimensional representation of quantum circuits. This representation can then be used to efficiently guide the optimization process using gradient-based methods. We demonstrate, theoretically, that the GAN's ability to learn complex mappings from high-dimensional space to lower-dimensional space can significantly accelerate the optimization process compared to conventional techniques. The key formulation involves a generator network, G(s), which maps a quantum circuit (s) to a lower-dimensional latent space, and a discriminator network, D(z), which distinguishes between real and generated latent representations. The optimization process hinges on the adversarial training between G and D. We present a framework for this process, outlining the mathematical foundations and potential advantages. This work lays the groundwork for future research exploring GANs as a powerful tool for quantum circuit optimization.