Revisiting semiconductor bulk hamiltonians using quantum computers

• URL: http://arxiv.org/abs/2208.10323v1
• Date: Mon, 22 Aug 2022 14:02:29 GMT
• Title: Revisiting semiconductor bulk hamiltonians using quantum computers
• Authors: Raphael C\'esar de Souza Pimenta, and Anibal Thiago Bezerra
• Abstract summary: We use k$cdot$p Hamiltonians to describe semiconductor structures of the III-V family. We obtain their band structures using a state vector solver, a probabilistic simulator, and a real noisy-device simulator.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: With the advent of near-term quantum computers, the simulation of properties of solids using quantum algorithms becomes possible. By an adequate description of the system's Hamiltonian, variational methods enable to fetch the band structure and other fundamental properties as transition probabilities. Here, we use k$\cdot$p Hamiltonians to describe semiconductor structures of the III-V family and obtain their band structures using a state vector solver, a probabilistic simulator, and a real noisy-device simulator. The resulting band structures are in good agreement with the ones obtained by direct diagonalization of the Hamiltonian. Simulation times depend on the optimizer, circuit depth, and simulator used. Finally, with the optimized eigenstates, we convey the inter-band absorption probability, demonstrating the possibility of analyzing the fundamental properties of crystalline systems using quantum computers.

Related papers

• Learning interactions between Rydberg atoms [4.17037025217542]
  We introduce a scalable approach to Hamiltonian learning using graph neural networks (GNNs) We demonstrate that our GNN model has a remarkable capacity to extrapolate beyond its training domain.
  arXiv  Detail & Related papers  (2024-12-16T17:45:30Z)
• Simulating Schwinger model dynamics with quasi-one-dimensional qubit arrays [0.0]
  We develop a strategy to run Schwinger model dynamics on synthetic quantum spin lattices. We show that global magnetic field patterns can drive coherent quantum dynamics of the interface equivalent to the lattice Schwinger Hamiltonian. This work opens up a path for near-term quantum simulators to address questions of immediate relevance to particle physics.
  arXiv  Detail & Related papers  (2024-09-22T17:58:25Z)
• Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers [1.2912607909040075]
  Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians. We show that utilizing quantum algorithms for obtaining the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions.
  arXiv  Detail & Related papers  (2024-09-18T18:00:04Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Programmable Simulations of Molecules and Materials with Reconfigurable Quantum Processors [0.3320294284424914]
  We introduce a simulation framework for strongly correlated quantum systems that can be represented by model spin Hamiltonians. Our approach leverages reconfigurable qubit architectures to programmably simulate real-time dynamics. We show how this method can be used to compute key properties of a polynuclear transition-metal catalyst and 2D magnetic materials.
  arXiv  Detail & Related papers  (2023-12-04T19:00:01Z)
• Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers [0.0]
  We propose a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. The proposed algorithms are potentially feasible to tackle some challenging molecules by exploiting quantum devices with several tens of qubits.
  arXiv  Detail & Related papers  (2023-02-22T12:05:31Z)
• 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)
• 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)
• Verifying quantum information scrambling dynamics in a fully controllable superconducting quantum simulator [0.0]
  We study the verified scrambling in a 1D spin chain by an analogue superconducting quantum simulator with the signs and values of individual driving and coupling terms fully controllable. Our work demonstrates the superconducting system as a powerful quantum simulator.
  arXiv  Detail & Related papers  (2021-12-21T13:41:47Z)
• 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)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Hardware Efficient Quantum Algorithms for Vibrational Structure Calculations [0.0]
  We introduce a framework for the calculation of ground and excited state energies of bosonic systems suitable for near-term quantum devices. We test different parametrizations of the vibrational wave function, which can be encoded in quantum hardware. We evaluate the requirements, number of qubits and circuit depth, for the calculation of vibrational energies on quantum hardware.
  arXiv  Detail & Related papers  (2020-03-27T18:00:23Z)

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.