Variational Quantum Linear Solver for Simulating Quantum Transport in Nanoscale Semiconductor Devices

• URL: http://arxiv.org/abs/2509.07005v1
• Date: Sat, 06 Sep 2025 01:53:32 GMT
• Title: Variational Quantum Linear Solver for Simulating Quantum Transport in Nanoscale Semiconductor Devices
• Authors: Qimao Yang, Jing Guo,
• Abstract summary: We develop simulation methods that enable the application of the variational quantum linear solver (VQLS) to simulate quantum transport in nanoscale semiconductor devices.<n>We propose new forms of cost functions to solve complex and non-symmetric linear systems with faster computing speed.
• Score: 4.258785028734343
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work develops simulation methods that enable the application of the variational quantum linear solver (VQLS) to simulate quantum transport in nanoscale semiconductor devices. Most previous work on VQLS applications in semiconductor device simulations focuses on solving the Poisson equation, where the coefficient matrix of the sparse linear system is real and symmetric. Solving the quantum transport equation, however, leads to coefficient matrices that are complex and non-symmetric. This work addresses the challenges of applying VQLS to quantum transport simulations. We propose new forms of cost functions to solve complex and non-symmetric linear systems with faster computing speed. We further develop efficient decomposition methods for cost function evaluation, which target reducing the quantum circuit complexity and improving noise robustness when solving the quantum transport equation using the non-equilibrium Green's function method. While classical computation faces the challenge of the "curse of dimensionality" as the spatial-energy numerical grid dimensions grow, the proposed quantum-computing-based method scales logarithmically with the grid size, which offers a promising opportunity for addressing the computational challenges of solving quantum transport in semiconductor devices.

Related papers

• Trotter-based quantum algorithm for solving transport equations with exponentially fewer time-steps [0.0]
  We present a quantum numerical scheme based on three steps: quantum state preparation, evolution, and measurement.<n>We introduce novel vector-norm analysis and prove that the number of time-steps can be reduced by a factor exponential in the number of qubits.<n>We also present efficient quantum circuits and numerical simulations that confirm the predicted vector-norm scaling.
  arXiv  Detail & Related papers  (2025-08-21T16:14:05Z)
• PolyQROM: Orthogonal-Polynomial-Based Quantum Reduced-Order Model for Flow Field Analysis [5.588958112139646]
  Quantum computing promises exponential acceleration for fluid flow simulations.<n> measurement overhead required to extract flow features from quantum-encoded flow field data undermines this advantage.
  arXiv  Detail & Related papers  (2025-04-30T12:14:08Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Quantum Speedup in Dissecting Roots and Solving Nonlinear Algebraic Equations [0.0]
  It is shown that quantum computer can detect the existence of root of a function almost exponentially more efficient than the classical counterpart.<n>Various applications and implications are discussed, including a quantum algorithm for solving dense linear systems.
  arXiv  Detail & Related papers  (2025-03-09T13:27:11Z)
• An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations [0.0]
  We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS)<n>This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions.<n>We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation.
  arXiv  Detail & Related papers  (2025-01-19T19:03:29Z)
• 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)
• Enabling Large-Scale and High-Precision Fluid Simulations on Near-Term Quantum Computers [17.27937804402152]
  Quantum computational fluid dynamics (QCFD) offers a promising alternative to classical computational fluid dynamics (CFD) This paper introduces a comprehensive QCFD method, including an iterative method "Iterative-QLS" that suppresses error in quantum linear solver. We implement our method on a superconducting quantum computer, demonstrating successful simulations of steady Poiseuille flow and unsteady acoustic wave propagation.
  arXiv  Detail & Related papers  (2024-06-10T07:21:23Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm [58.720142291102135]
  We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL) This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
  arXiv  Detail & Related papers  (2022-10-23T11:58:05Z)
• 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)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

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.