Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers

• URL: http://arxiv.org/abs/2606.20805v1
• Date: Thu, 18 Jun 2026 18:00:16 GMT
• Title: Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
• Abstract summary: We introduce an algorithm for estimating the distribution complexity of hybrid quantum-classical simulation for electronic structure Hamiltonians.<n>We show that emergent entanglement patterns are induced by the interplay between coherent Gaussian orbital rotations and disordered Coulomb interactions.<n>The framework introduced here enables novel and more efficient quantum-classical application towards utility-scale quantum computing.
• Score: 0.005390659954881999
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient simulation of strongly-interacting fermionic systems on quantum processing units (QPUs) is a challenging task due to nonlocal mode entanglement generation. However, it is not yet well understood how the structure of entanglement governs the hardness of large-scale quantum chemistry simulations or the scaling of distributing such workloads. Here, we introduce an algorithm for estimating the distribution complexity of hybrid quantum-classical simulation for electronic structure Hamiltonians over heterogeneous high-performance architectures. Our algorithm relies on efficient analytical evaluation of the low entanglement boundaries for the orbital rotations and dephasing-induced localization within tensor fragments, in a double-factorized representation. Our entanglement estimation scales as $O(N^3)$ for each fragment, where $N$ is the number of orbitals. When QPUs are communicating via a quantum network, the cost of distribution per fragment is reduced quadratically from $O(N^2)$ to $O(N)$. Similarly, for hybrid quantum-classical approaches, with access to only conventional HPC interconnects, the worst-case cost is reduced from $O(\exp(N^2))$ to $O(\exp(N))$. We show that emergent entanglement patterns are induced by the interplay between coherent Gaussian orbital rotations and disordered Coulomb interactions. We discuss the underlying physical mechanisms that govern distribution complexity and introduce model systems that are tunable based on the localizability of fragments and the overlap of interfragment rotations. We characterize three different regimes of hardness for distribution complexity and classical simulability. The framework introduced here enables novel and more efficient quantum-classical application workflows towards utility-scale quantum computing.

Related papers

• Stacking the Deck: Tunable Trainability in Stacked LCUs [5.3795542973467905]
  Variational quantum circuits have been central to many proposed near-term applications of quantum computing.<n>We propose a stacked linear combination of unitaries (S-LCU) as a variational ansatz which provides a tunable trade-off between barren plateaus and classical simulability.
  arXiv  Detail & Related papers  (2026-07-27T17:25:14Z)
• Excited-State Quantum Chemistry on Qumode-Based Processors via Variational Quantum Deflation [0.0]
  Variational quantum algorithms on bosonic quantum processors are an emerging paradigm for quantum chemistry calculations.<n>We introduce the qumode-based variational quantum deflation framework (QumVQD) for finding both electronic and vibrational excited state energies.
  arXiv  Detail & Related papers  (2026-04-15T04:24:32Z)
• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers [0.0]
  We show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states.<n>Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
  arXiv  Detail & Related papers  (2024-04-29T17:14:21Z)
• Simulating electronic structure on bosonic quantum computers [34.84696943963362]
  We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Demonstration of tunable three-body interactions between superconducting qubits [38.98439939494304]
  We present a superconducting circuit architecture in which a coupling module mediates 2-local and 3-local interactions. The 3-local interaction is coherently tunable over several MHz via the coupler flux biases and can be turned off.
  arXiv  Detail & Related papers  (2022-05-09T20:23:43Z)
• Qubit-efficient encoding scheme for quantum simulations of electronic structure [5.16230883032882]
  Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. We propose a qubit-efficient encoding scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era.
  arXiv  Detail & Related papers  (2021-10-08T13:20:18Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• A systematic variational approach to band theory in a quantum computer [0.0]
  We present a hybrid quantum-classical algorithm to solve the band structure of any periodic system. We show that the algorithm is reliable in a low-noise device, functional with low precision on present-day noisy quantum computers.
  arXiv  Detail & Related papers  (2021-04-07T21:50:19Z)

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.