Random State Approach to Quantum Computation of Electronic-Structure Properties

• URL: http://arxiv.org/abs/2510.09999v1
• Date: Sat, 11 Oct 2025 03:51:23 GMT
• Title: Random State Approach to Quantum Computation of Electronic-Structure Properties
• Authors: Yiran Bai, Feng Xiong, Xueheng Kuang,
• Abstract summary: We propose and implement random-state quantum algorithms to calculate electronic-structure properties of real materials.<n>We validate these algorithms by numerically computing the density of states and spatial distributions of electronic states in graphene, twisted bilayer graphene quasicrystals, and fractal lattices.
• Score: 2.4028888270203215
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical computation of electronic properties in large-scale materials remains challenging. Quantum computation has the potential to offer advantages in memory footprint and computational scaling. However, general and practical quantum algorithms for simulating large-scale materials are still lacking. We propose and implement random-state quantum algorithms to calculate electronic-structure properties of real materials. Using a random state circuit with only a few qubits, we employ real-time evolution with first-order Trotter decomposition and Hadamard test to obtain electronic density of states, and we develop a modified quantum phase estimation algorithm to calculate real-space local density of states via direct quantum measurements. Furthermore, we validate these algorithms by numerically computing the density of states and spatial distributions of electronic states in graphene, twisted bilayer graphene quasicrystals, and fractal lattices, covering system sizes from hundreds to thousands of atoms. Our results manifest that the random-state quantum algorithms provide a general and qubit-efficient route to simulating electronic properties of large-scale periodic and aperiodic materials on quantum computers.

Related papers

• 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)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Electronic Structure Calculations using Quantum Computing [0.0]
  We present a hybrid Classical-Quantum computational procedure that uses the Variational Quantum Eigensolver (VQE) algorithm. Our algorithm offers a streamlined process requiring fewer computational resources than classical methods. Results indicate the potential of the algorithm to expedite the development of new materials and technologies.
  arXiv  Detail & Related papers  (2023-05-13T12:02:05Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods [0.4215938932388722]
  Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory. We show that certain first quantized quantum algorithms enable exact time evolution of electronic systems with exponentially less space and fewer functional operations in basis set size.
  arXiv  Detail & Related papers  (2023-01-03T17:00:40Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Quantum computation of silicon electronic band structure [0.0]
  We show that unprecedented methods used in quantum chemistry, designed to simulate molecules on quantum processors, can be extended to calculate properties of periodic solids. In particular, we present minimal depth circuits implementing the variational quantum eigensolver algorithm and successfully use it to compute the band structure of silicon on a quantum machine for the first time.
  arXiv  Detail & Related papers  (2020-06-06T07:45:06Z)
• Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions [0.8315657895474382]
  We show that there exist families of quantum states that can be prepared to high precision with circuits of linear size and depth. We further develop an algorithm that requires only linear classical time to generate accurate linear-depth circuits.
  arXiv  Detail & Related papers  (2020-05-09T02:31:44Z)
• Quantum simulations of materials on near-term quantum computers [1.856334276134661]
  We present a quantum embedding theory for the calculation of strongly-correlated electronic states of active regions. We demonstrate the accuracy and effectiveness of the approach by investigating several defect quantum bits in semiconductors.
  arXiv  Detail & Related papers  (2020-02-25T20:57:57Z)

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.