Scalable quantum circuit generation for iterative ground state approximation using Majorana Propagation

• URL: http://arxiv.org/abs/2603.23444v1
• Date: Tue, 24 Mar 2026 17:14:37 GMT
• Title: Scalable quantum circuit generation for iterative ground state approximation using Majorana Propagation
• Abstract summary: ADAPT-VMPE produces circuits for approximating the ground state of molecular Hamiltonians.<n>We construct up to 100-qubit anstze for a strongly correlated photosensitizer undergoing human clinical trials for cancer treatment.
• Score: 0.2419826154435114
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce the Adaptive Derivative-Assembled Pseudo-Trotter ansatz Variational Majorana Propagation Eigensolver (ADAPT-VMPE), a quantum-inspired classical algorithm that exploits Majorana Propagation (MP) to produce circuits for approximating the ground state of molecular Hamiltonians. Equipped with the theoretical guarantees of MP, which provide controllable bounds on the approximation error, ADAPT-VMPE offers an efficient and scalable approach for iterative ansatz construction. A theoretical analysis of the computational complexity demonstrates that it is polynomial in both the number of qubits and the number of iterations. We present an in-depth analysis of circuit construction strategies, analyzing their impact on convergence and provide practical guidance for efficient ansatz generation. Using ADAPT-VMPE, we construct up to 100-qubit ansätze for a strongly correlated photosensitizer currently undergoing human clinical trials for cancer treatment. Our results demonstrate that constant overlap with the ground state across system sizes can be reached in polynomial time with polynomially sized circuits.

Related papers

• Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control [42.97938764966747]
  We present a unifying framework for gradient-based quantum optimal control.<n>For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients.<n>The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions.
  arXiv  Detail & Related papers  (2026-07-29T12:50:52Z)
• Quantum Signal Processing for Linear PDEs: Circuit Design and Experimental Validation [1.814099487268094]
  We develop end-to-end implementations of quantum circuits compiled to machine-level instructions.<n>We experimentally demonstrate that the QSP-augmented algorithm can provide accurate solutions under realistic hardware constraints.
  arXiv  Detail & Related papers  (2026-05-29T21:21:32Z)
• Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers [2.5315729179239637]
  We present a quantum simulation framework for real-time dynamics of the multi-flavor Gross-Neveu model in 1+1 dimensions.<n>We develop a hardware-efficient Trotterization whose per-step circuit depth scales with fermion flavor number rather than total system size.<n>A central contribution of this work is the Localized Diagonal Operator Approximation (LDOA), which systematically reduces the overhead associated with quartic interactions.
  arXiv  Detail & Related papers  (2026-05-06T21:57:51Z)
• Constant Depth Digital-Analog Counterdiabatic Quantum Computing [1.8923689868452591]
  We introduce a digital-analog quantum computing framework that enables counterdiabatic protocols to be implemented at constant circuit depth.<n>Counterdiabatic protocols suppress diabatic excitations in finite-time adiabatic evolution.<n>We show how this structure can be efficiently realized in a digital-analog setting using commutator product formulas.
  arXiv  Detail & Related papers  (2026-01-03T10:55:08Z)
• Seeding neural network quantum states with tensor network states [0.0]
  We find an efficient approach to convert matrix product states (MPSs) into restricted Boltzmann machine wave functions consisting of a multinomial unit.<n>This method allows us to generate hidden initial neural network quantum states for many-body ground-state calculations.<n>We discuss possible applications of our method to more general quantum many-body systems in which the ground-state wave functions possess complex nodal structures.
  arXiv  Detail & Related papers  (2025-06-30T06:49:31Z)
• More entropy from shorter experiments using polytope approximations to the quantum set [0.0]
  We introduce a systematic method for constructing polytope approximations to the quantum set in a variety of device-independent quantum random number generation (DI-QRNG) protocols.<n>Our approach relies on two general-purpose cryptographic algorithms that iteratively refine an initial outer-polytope approximation.<n>We obtain significantly improved certified entropy bounds in the finite-size regime.
  arXiv  Detail & Related papers  (2025-06-11T09:37:56Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.