Variational Quantum Eigensolver Models of Molecular Quantum Dot Cellular Automata

• URL: http://arxiv.org/abs/2510.12656v1
• Date: Tue, 14 Oct 2025 15:50:21 GMT
• Title: Variational Quantum Eigensolver Models of Molecular Quantum Dot Cellular Automata
• Authors: Nischal Binod Gautam, Enrique P. Blair,
• Abstract summary: This work explores the use of the noisy-intermediate scale quantum (NISQ) variational quantum eigensolver (VQE) method for estimating the ground state of QCA circuits.<n>VQE is used to model logic circuits, including binary wires, inverters, and majority gates.<n>It is observed that using modern NISQ hardware, results are still quite sensitive to noise, so measures should be taken to minimize noise.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Molecular quantum-dot Cellular Automata (QCA) may provide low-power, high-speed computational hardware for processing classical information. Simulation and modeling play an important role in the design of QCA circuits because fully-coherent models of QCA scale exponentially with the number of devices, and such models are severely limited in size. For larger circuits, approximations become necessary. In the era of fault-tolerant quantum computation, however, it may become possible to model large QCA circuits without such limitations. Presently, this work explores the use of the noisy-intermediate scale quantum (NISQ) variational quantum eigensolver (VQE) method for estimating the ground state of QCA circuits. This is relevant because the computational result of a QCA calculation is encoded in the circuit's ground state. In this study, VQE is used to model logic circuits, including binary wires, inverters, and majority gates. VQE models are performed ideal simulators, noisy simulators, and actual quantum hardware. This study demonstrates that VQE may indeed be used to model molecular QCA circuits. It is observed that using modern NISQ hardware, results are still quite sensitive to noise, so measures should be taken to minimize noise. These include simplifying the ansatz circuit whenever possible, and using low-noise hardware.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Toward Large-Scale Distributed Quantum Long Short-Term Memory with Modular Quantum Computers [5.673361333697935]
  We introduce a Distributed Quantum Long Short-Term Memory (QLSTM) framework to address scalability challenges on Noisy Intermediate-Scale Quantum (NISQ) devices.<n>QLSTM captures long-range temporal dependencies, while a distributed architecture partitions the underlying Variational Quantum Circuits into smaller, manageable subcircuits.<n>We demonstrate that the distributed QLSTM achieves stable convergence and improved training dynamics compared to classical approaches.
  arXiv  Detail & Related papers  (2025-03-18T10:07:34Z)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• Differentiable Quantum Architecture Search for Quantum Reinforcement Learning [30.324343192917606]
  Differentiable quantum architecture search (DQAS) is a gradient-based framework to design quantum circuits automatically in the NISQ era. This work is the first to show that gradient-based quantum architecture search is applicable to quantum deep Q-learning tasks.
  arXiv  Detail & Related papers  (2023-09-19T07:45:39Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [48.491303218786044]
  TeD-Q is an open-source software framework for quantum machine learning.<n>It seamlessly integrates classical machine learning libraries with quantum simulators.<n>It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• Efficient Mean-Field Simulation of Quantum Circuits Inspired by Density Functional Theory [1.3561290928375374]
  Exact simulations of quantum circuits (QCs) are currently limited to $sim$50 qubits. Here we show simulations of QCs with a method inspired by density functional theory (DFT) Our calculations can predict marginal single-qubit probabilities with over 90% accuracy in several classes of QCs with universal gate sets.
  arXiv  Detail & Related papers  (2022-10-29T02:12:15Z)
• Improved variational quantum eigensolver via quasi-dynamical evolution [0.0]
  The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for current and near-term quantum devices. There are problems with VQE that forbid a favourable scaling towards quantum advantage. We propose and extensively test a quantum annealing inspired algorithm that supplements VQE. The improved VQE avoids barren plateaus, exits local minima, and works with low-depth circuits.
  arXiv  Detail & Related papers  (2022-02-21T11:21:44Z)
• 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)
• Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
  We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits. The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
  arXiv  Detail & Related papers  (2021-06-14T17:23:46Z)
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations [18.78105450344374]
  This paper introduces CutQC, a scalable hybrid computing approach that combines classical computers and quantum computers. CutQC cuts large quantum circuits into smaller subcircuits, allowing them to be executed on smaller quantum devices. In real-system runs, CutQC achieves much higher quantum circuit evaluation fidelity using small prototype quantum computers.
  arXiv  Detail & Related papers  (2020-12-03T23:52:04Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)

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.