Improving initial-state-dependent quantum circuit optimization by introducing state labels
- URL: http://arxiv.org/abs/2509.04761v1
- Date: Fri, 05 Sep 2025 02:42:54 GMT
- Title: Improving initial-state-dependent quantum circuit optimization by introducing state labels
- Authors: Toshiaki Kaji, Koji Terashi, Ryu Sawada,
- Abstract summary: We are developing a quantum-state-dependent circuit called AQCEL.<n>Our guiding principle is to optimize quantum circuits by measuring the states of the control qubits to identify and eliminate unnecessary control operations.<n>These enhancements significantly reduce the number of two-qubit gates, improving the fidelity of quantum circuits executed on quantum hardware.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: While the capabilities of quantum hardware have significantly advanced in recent years, executing quantum algorithms as quantum circuits at the lowest possible cost remains crucial, regardless of the hardware progress. We are developing a quantum-state-dependent circuit optimizer called AQCEL. Our guiding principle, implemented as the AQCEL optimization protocol, is to optimize quantum circuits by measuring the states of the control qubits to identify and eliminate unnecessary control operations. In this paper, we introduce two key improvements: the state label manager that reduces unnecessary state measurements and the $CX$-pair removal process that eliminates redundant gate pairs. These enhancements significantly reduce the number of two-qubit gates, improving the fidelity of quantum circuits executed on quantum hardware. To demonstrate the effectiveness of our method, we apply AQCEL to quantum circuits for the quantum parton shower algorithm. Experimental results using the IBM quantum computer show a substantial reduction in gate counts and an improvement in fidelity compared to the conventional optimization technique as well as the original AQCEL protocol. Our findings highlight the potential of state-dependent circuit optimization for enhancing the performance of quantum algorithms on near-term quantum devices.
Related papers
- Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
arXiv Detail & Related papers (2025-05-24T02:51:34Z) - Quantum Multiplexer Simplification for State Preparation [0.7270112855088837]
We propose an algorithm that detects whether a given quantum state can be factored into substates.
The simplification is done by eliminating controls of quantum multiplexers.
Considering efficiency in terms of depth and number of CNOT gates, our method is competitive with the methods in the literature.
arXiv Detail & Related papers (2024-09-09T13:53:02Z) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - QuBEC: Boosting Equivalence Checking for Quantum Circuits with QEC
Embedding [4.15692939468851]
We propose a Decision Diagram-based quantum equivalence checking approach, QuBEC, that requires less latency compared to existing techniques.
Our proposed methodology reduces verification time on certain benchmark circuits by up to $271.49 times$.
arXiv Detail & Related papers (2023-09-19T16:12:37Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Enhancing Quantum Annealing in Digital-Analog Quantum Computing [0.0]
Digital-analog quantum computing (DAQC) offers a promising approach to addressing the challenges of building a practical quantum computer.
We propose an algorithm designed to enhance the performance of quantum annealing.
This study provides an example of how processing quantum data using a quantum circuit can outperform classical data processing, which discards quantum information.
arXiv Detail & Related papers (2023-06-03T09:16:15Z) - Initial-State Dependent Optimization of Controlled Gate Operations with
Quantum Computer [1.2019888796331233]
We introduce a new circuit called AQCEL, which aims to remove redundant controlled operations from controlled gates.
As a benchmark, the AQCEL is deployed on a quantum algorithm designed to model final state radiation in high energy physics.
We have demonstrated that the AQCEL-optimized circuit can produce equivalent final states with much smaller number of gates.
arXiv Detail & Related papers (2022-09-06T09:19:07Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Quantum Gate Pattern Recognition and Circuit Optimization for Scientific
Applications [1.6329956884407544]
We introduce two ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL.
AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics.
Our technique is generic and can be useful for a wide variety of quantum algorithms.
arXiv Detail & Related papers (2021-02-19T16:20:31Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.