Automated Unitary Coupled Cluster Circuit Design via Differentiable Quantum Architecture Search

• URL: http://arxiv.org/abs/2605.28049v1
• Date: Wed, 27 May 2026 06:50:01 GMT
• Title: Automated Unitary Coupled Cluster Circuit Design via Differentiable Quantum Architecture Search
• Abstract summary: We introduce differentiable quantum architecture search (DQAS) as a circuit design framework based on the UCCSD operator pool.<n>We show that both strategies achieve higher accuracy and fewer CNOT gates than ADAPT-VQE in the compact circuit regime.
• Score: 3.2386300676469673
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Designing compact and accurate circuits for the variational quantum eigensolver (VQE) is a central challenge in near-term quantum chemistry. Existing adaptive methods such as ADAPT-VQE design circuits by iteratively selecting operators from a predefined pool guided by gradient information and greedy heuristics. In this work, we adopt differentiable quantum architecture search (DQAS) as a circuit design framework based on the UCCSD operator pool, and introduce two complementary strategies: a global mode that simultaneously optimizes all operator selections, and a layerwise mode that constructs circuits incrementally while preserving previously learned structure. By relaxing discrete operator selection into a continuous differentiable optimization, DQAS enables gradient-based exploration over the combinatorial space of UCC circuit architectures. Benchmarks on BeH2, H4, LiH, H6, and H2O (8-14 qubits) show that both strategies achieve higher accuracy and fewer CNOT gates than ADAPT-VQE in the compact circuit regime, with up to 2.7-fold accuracy improvement for H2O and CNOT reductions of 13-17% at equivalent circuit depths. Benchmarks on the qubit-excitation-based (QEB) operator pool confirm that both advantages generalize beyond UCCSD. These results demonstrate that differentiable architecture search provides an effective and generalizable framework for designing accurate and compact VQE circuits in near-term quantum chemistry.

Related papers

• Investigation of Automated Design of Quantum Circuits for Imaginary Time Evolution Methods Using Deep Reinforcement Learning [6.1990010478895]
  We present an automated framework for VITE circuit design using Double Deep-Q Networks (DDQN)<n>Our approach treats circuit construction as a multi-objective problem, simultaneously minimizing energy expectation values and optimizing circuit complexity.<n>In Max-Cut problems, our agent autonomously discovered circuits with approximately 37% fewer gates and 43% less depth than standard hardware-efficient ansatz.
  arXiv  Detail & Related papers  (2026-04-09T08:17:11Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Probabilistic Design of Parametrized Quantum Circuits through Local Gate Modifications [40.28072745340568]
  We propose an evolution-inspired quantum architecture search algorithm, which we refer to as the local quantum architecture search.<n>The goal of the local quantum architecture search algorithm is to optimize parametrized quantum circuit architectures.<n>We evaluate the local quantum architecture search algorithm on two synthetic function-fitting regression tasks and two quantum chemistry regression datasets.
  arXiv  Detail & Related papers  (2026-02-12T22:47:03Z)
• Quantum-Based Self-Attention Mechanism for Hardware-Aware Differentiable Quantum Architecture Search [21.477208706334608]
  We introduce the Quantum-Based Self-Attention for Differentiable Quantum Architecture Search (QBSA-DQAS)<n>The framework employs a two-stage quantum self-attention module that computes contextual dependencies by mapping architectural parameters through quantum circuits.<n>A post-search optimization stage applies gate commutation, fusion, and elimination to reduce circuit complexity.
  arXiv  Detail & Related papers  (2025-12-02T07:07:10Z)
• QASER: Breaking the Depth vs. Accuracy Trade-Off for Quantum Architecture Search [43.72215866683917]
  Quantum computing faces a key challenge: balancing the need for low circuit depth with the high accuracy required for complex computations.<n>We introduce a novel reinforcement learning approach featuring engineered reward functions, called textbfQASER.<n>We achieve up to 50% improved accuracy, while reducing 2-qubit gate counts and depths by 20%.
  arXiv  Detail & Related papers  (2025-11-20T11:53:38Z)
• Automated Design of Structured Variational Quantum Circuits with Reinforcement Learning [10.136215038345012]
  This work represents the synthesis of variational quantum circuits as a sequential decision-making problem.<n>We introduce two reinforcement learning-based methods, RLVQC Global and RLVQC Block, tailored to optimization problems.<n>Our results show that both RLVQC methods exhibit strong results with RLVQC Block consistently outperforming QAOA and generally surpassing RLVQC Global.
  arXiv  Detail & Related papers  (2025-07-21T18:40:59Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors [5.012570785656963]
  Dynamically field-programmable qubit arrays (DPQA) have emerged as a promising platform for quantum information processing. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements. We show that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture.
  arXiv  Detail & Related papers  (2023-06-06T08:13:10Z)
• Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
  We design quantum circuits by using the standard cell approach borrowed from classical circuit design. We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
  arXiv  Detail & Related papers  (2022-06-10T10:54:46Z)
• Ansatz-Independent Variational Quantum Classifier [0.0]
  We show that variational quantum classifiers (VQCs) fit inside the well-known kernel method. We also propose a variational circuit realization (VCR) for designing efficient quantum circuits for a given unitary operator.
  arXiv  Detail & Related papers  (2021-02-02T21:25:39Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.