Efficient quantum state preparation through seniority driven operator selection

• URL: http://arxiv.org/abs/2504.19760v1
• Date: Mon, 28 Apr 2025 12:56:57 GMT
• Title: Efficient quantum state preparation through seniority driven operator selection
• Authors: Dipanjali Halder, Dibyendu Mondal, Rahul Maitra,
• Abstract summary: Quantum algorithms require accurate representations of electronic states on a quantum device.<n>Existing methods struggle to balance the competing demands of chemical accuracy and gate efficiency.<n>We propose an algorithmic framework that focuses on efficiently capturing the molecular strong correlation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum algorithms require accurate representations of electronic states on a quantum device, yet the approximation of electronic wave functions for strongly correlated systems remains a profound theoretical challenge, with existing methods struggling to balance the competing demands of chemical accuracy and gate efficiency. Moreover, a critical limitation of the most of the state-of-the-art methods developed to date lies in their substantial reliance on extensive pre-circuit measurements, which introduce significant overheads and contribute to inefficiencies in practical implementation. To address these interconnected challenges and establish a harmonious synergy between them, we propose an algorithmic framework that focuses on efficiently capturing the molecular strong correlation through an ordered set of computationally less demanding rank-one and seniority-zero excitations, yielding a parameterized ansatz with shallow gate depth. Furthermore, to achieve minimal pre-circuit measurement overhead, we implement a selective pruning of excitations through a hybrid approach that combines intuition-based selection with shallow-depth, rank-one excitations driven uni-parameter circuit optimization strategy. With the incorporation of qubit-based excitations via particle-preserving exchange circuits, we demonstrate a further reduction in quantum complexities, enhancing the overall resource efficiency of the approach. With a range of challenging applications on strongly correlated systems, we demonstrate that our dynamic ansatz not only significantly enhances computational efficiency but also delivers exceptional accuracy, robustness, and resilience to the noisy environments inherent in near-term quantum hardware.

Related papers

• Advancing quantum process tomography through universal compilation [0.0]
  Quantum process tomography (QPT) is crucial for characterizing operations in quantum gates and circuits.<n>Here, we propose a QPT approach based on universal compilation, which systematically decomposes quantum processes into optimized Kraus operators and Choi matrices.<n>We benchmark our approach through numerical simulations of random unitary gates, demonstrating highly accurate quantum process characterization.
  arXiv  Detail & Related papers  (2025-04-21T08:34:33Z)
• Towards a Resource-Optimized Dynamic Quantum Algorithm via Non-iterative Auxiliary Subspace Corrections [0.0]
  We develop a novel theoretical framework that relies on the segregation of an ansatz into a dynamically selected core principal component. We propose a formalism that analytically predicts the auxiliary parameters from the principal ones, followed by a suite of non-iterative auxiliary subspace correction techniques. We have numerically validated the resource efficiency and accuracy of our formalism with a number of strongly correlated molecular systems.
  arXiv  Detail & Related papers  (2024-08-23T09:50:15Z)
• 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)
• Projective Quantum Eigensolver via Adiabatically Decoupled Subsystem Evolution: a Resource Efficient Approach to Molecular Energetics in Noisy Quantum Computers [0.0]
  We develop a projective formalism that aims to compute ground-state energies of molecular systems accurately using Noisy Intermediate Scale Quantum (NISQ) hardware. We demonstrate the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems.
  arXiv  Detail & Related papers  (2024-03-13T13:27:40Z)
• Quantum Advantage Actor-Critic for Reinforcement Learning [5.579028648465784]
  We propose a novel quantum reinforcement learning approach that combines the Advantage Actor-Critic algorithm with variational quantum circuits. We empirically test multiple quantum Advantage Actor-Critic configurations with the well known Cart Pole environment to evaluate our approach in control tasks with continuous state spaces.
  arXiv  Detail & Related papers  (2024-01-13T11:08:45Z)
• 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)
• On-the-fly Tailoring towards a Rational Ansatz Design for Digital Quantum Simulations [0.0]
  It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices. We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz. The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
  arXiv  Detail & Related papers  (2023-02-07T11:22:01Z)
• 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)
• 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)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• 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.