"Toward" Metal-Organic Framework Design by Quantum Computing

• URL: http://arxiv.org/abs/2309.05465v1
• Date: Mon, 11 Sep 2023 14:07:30 GMT
• Title: "Toward" Metal-Organic Framework Design by Quantum Computing
• Abstract summary: The article summarizes the study performed in the context of the Deloitte Quantum Climate Challenge in 2023. We present a hybrid quantum-classical method for calculating Potential Energy Surface scans. The primary objective of this challenge was to highlight the potential advantages of employing quantum computing.
• Score: 0.46873264197900916
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The article summarizes the study performed in the context of the Deloitte Quantum Climate Challenge in 2023. We present a hybrid quantum-classical method for calculating Potential Energy Surface scans, which are essential for designing Metal-Organic Frameworks for Direct Air Capture applications. The primary objective of this challenge was to highlight the potential advantages of employing quantum computing. To evaluate the performance of the model, we conducted total energy calculations using various computing frameworks and methods. The results demonstrate, at a small scale, the potential advantage of quantum computing-based models. We aimed to define relevant classical computing model references for method benchmarking. The most important benefits of using the PISQ approach for hybrid quantum-classical computational model development and assessment are demonstrated.

Related papers

• QeHDC: Hyperdimensional Computing based on Quantum-enhanced binding and SuperClass Construction [8.130961247419288]
  Quantum-enhanced Hyperdimensional Computing (QeHDC) extends classical HDC by leveraging quantum mechanical properties to enhance computational efficiency.<n>We propose a novel Quantum HDC framework featuring a one-pass training method, leveraging sinusoidal and quantum encoding to project classical data into quantum amplitude states efficiently.
  arXiv  Detail & Related papers  (2026-06-21T10:18:04Z)
• Measuring Accuracy and Energy-to-Solution of Quantum Fine-Tuning of Foundational AI Models [1.75181998606904]
  We present an experimental study of energy-to-solution (ETS) of hybrid quantum-classical applications.<n>ETS is enabled by direct instrumentation of power consumption of a Forte Enterprise trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2026-05-04T16:38:04Z)
• Enhancing the Scalability of Classical Surrogates for Real-World Quantum Machine Learning Applications [0.0]
  Quantum machine learning (QML) presents potential for early industrial adoption, yet limited access to quantum hardware remains a significant bottleneck for deployment of QML solutions.<n>This work explores the use of classical surrogates to bypass this restriction, which is a technique that allows to build a lightweight classical representation of a quantum model.<n>We demonstrate the effectiveness of our method on a real-world energy demand forecasting problem, conducting rigorous testing of performance and computation demand in both simulations and on quantum hardware.
  arXiv  Detail & Related papers  (2025-08-08T08:51:01Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Extending Quantum Computing through Subspace, Embedding and Classical Molecular Dynamics Techniques [0.05185707610786576]
  We review techniques that facilitate the study of chemical systems with quantum computers.<n>We present a proof-of-concept demonstration of quantum-selected configuration interaction deployed within a multiscale/multiphysics simulation workflow.
  arXiv  Detail & Related papers  (2025-05-22T15:37:00Z)
• A Hybrid Quantum-Classical Particle-in-Cell Method for Plasma Simulations [2.0243676839636593]
  The electrostatic field Poisson solver is implemented on a quantum computer simulator using a hybrid classical-quantum Neural Network (HNN)<n>The HNN is trained on classical PIC simulation results and executed via a PennyLane quantum simulator.<n>We test the hybrid quantum-classical electrostatic PIC against the two-stream instability, a standard benchmark in plasma physics.
  arXiv  Detail & Related papers  (2025-05-14T10:19:33Z)
• On the impact of key design aspects in simulated Hybrid Quantum Neural Networks for Earth Observation [46.271239108950816]
  This research investigates how different quantum libraries behave when training hybrid quantum models. We also examine the benefits of hybrid quantum attention-based models in Earth Observation applications.
  arXiv  Detail & Related papers  (2024-10-11T10:04:29Z)
• Variational Quantum Eigensolver Approach to Prime Factorization on IBM's Noisy Intermediate Scale Quantum Computer [0.07499722271664146]
  The proposed algorithm is based on the Variational Quantum Eigensolver (VQE), which employs a classical method to find the ground state of a given Hamiltonian. A numerical study is presented, evaluating the performance of the proposed method across various instances on both IBM's real quantum computer and its classical simulator.
  arXiv  Detail & Related papers  (2024-10-02T18:33:36Z)
• Calculating the energy profile of an enzymatic reaction on a quantum computer [0.0]
  Quantum computing provides a promising avenue toward enabling quantum chemistry calculations. Recent research efforts are dedicated to developing and scaling algorithms for Noisy Intermediate-Scale Quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2024-08-20T18:00:01Z)
• Model-Driven Engineering for Quantum Programming: A Case Study on Ground State Energy Calculation [4.889818921125023]
  This study introduces a novel framework that brings together two main Quantum Programming methodologies, gate-based Quantum Computing and Quantum Annealing. It aims to enhance the adaptability, design and scalability of quantum programs, facilitating their design and operation across diverse computing platforms. A notable achievement of this research is the development of a mapping method for programs between gate-based quantum computers and quantum annealers.
  arXiv  Detail & Related papers  (2024-05-27T11:37:20Z)
• Practical and Scalable Quantum Reservoir Computing [0.0]
  Quantum Reservoir Computing leverages quantum systems to solve complex computational tasks with unprecedented efficiency and reduced energy consumption. This paper presents a novel QRC framework utilizing a quantum optical reservoir composed of two-level atoms within a single-mode optical cavity. We evaluate the reservoir's performance through two primary tasks: the prediction of time-series data via the classification of sine-square waveforms.
  arXiv  Detail & Related papers  (2024-05-08T04:14:31Z)
• Quantum Computing Enhanced Service Ecosystem for Simulation in Manufacturing [56.61654656648898]
  We propose a framework for a quantum computing-enhanced service ecosystem for simulation in manufacturing. We analyse two high-value use cases with the aim of a quantitative evaluation of these new computing paradigms for industrially-relevant settings.
  arXiv  Detail & Related papers  (2024-01-19T11:04:14Z)
• Peptide Binding Classification on Quantum Computers [3.9540968630765643]
  We conduct an extensive study on using near-term quantum computers for a task in the domain of computational biology. We perform sequence classification on a task relevant to the design of therapeutic proteins, and find competitive performance with classical baselines of similar scale. This work constitutes the first proof-of-concept application of near-term quantum computing to a task critical to the design of therapeutic proteins.
  arXiv  Detail & Related papers  (2023-11-27T10:32:31Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Quantum Machine Learning with SQUID [64.53556573827525]
  We present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. We provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset.
  arXiv  Detail & Related papers  (2021-04-30T21:34:11Z)
• Nearest Centroid Classification on a Trapped Ion Quantum Computer [57.5195654107363]
  We design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimations. We experimentally demonstrate it on a 11-qubit trapped-ion quantum machine, matching the accuracy of classical nearest centroid classifiers for the MNIST handwritten digits dataset and achieving up to 100% accuracy for 8-dimensional synthetic data.
  arXiv  Detail & Related papers  (2020-12-08T01:10:30Z)

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.