Quantum Computing Based Design of Multivariate Porous Materials

• URL: http://arxiv.org/abs/2502.06339v1
• Date: Mon, 10 Feb 2025 10:40:22 GMT
• Title: Quantum Computing Based Design of Multivariate Porous Materials
• Authors: Shinyoung Kang, Younghun Kim, Jihan Kim,
• Abstract summary: We propose a Hamiltonian model for quantum computing that integrates compositional, structural, and balance constraints directly into the Hamiltonian.<n>Our framework leads to exponentially efficient exploration of a vast search space of the linkers to identify optimal configurations.<n> Simulations on experimentally known MTV porous materials successfully reproduced their ground-state configurations.
• Score: 1.0923877073891446
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Multivariate (MTV) porous materials exhibit unique structural complexities based on their diverse spatial arrangements of multiple building block combinations. These materials possess potential synergistic functionalities that exceed the sum of their individual components. However, the exponentially increasing design complexity of these materials poses significant challenges for accurate ground-state configuration prediction and design. To address this, we propose a Hamiltonian model for quantum computing that integrates compositional, structural, and balance constraints directly into the Hamiltonian, enabling efficient optimization of the MTV configurations. The model employs a graph-based representation to encode linker types as qubits. Our framework leads to exponentially efficient exploration of a vast search space of the linkers to identify optimal configurations based on predefined design variables. To validate our model, a variational quantum circuit was constructed and executed using the Sampling VQE algorithm in the IBM Qiskit. Simulations on experimentally known MTV porous materials (e.g. Cu-THQ-HHTP, Py-MVDBA-COF, MUF-7, and SIOC-COF2) successfully reproduced their ground-state configurations, demonstrating the validity of our model.

Related papers

• Hybrid Quantum Classical Surrogate for Real Time Inverse Finite Element Modeling in Digital Twins [4.978621186982144]
  Large-scale civil structures, such as bridges, pipelines, and offshore platforms, are vital to modern infrastructure, where unexpected failures can cause significant economic and safety repercussions.<n>FE modeling is widely used for real-time structural health monitoring (SHM), its high computational cost and the complexity of inverse FE analysis pose ongoing challenges.<n>Here, we propose a hybrid quantum classical multilayer perceptron framework to tackle these issues.
  arXiv  Detail & Related papers  (2025-07-30T04:09:49Z)
• Spectral Normalization and Voigt-Reuss net: A universal approach to microstructure-property forecasting with physical guarantees [0.0]
  A crucial step in the design process is the rapid evaluation of effective mechanical, thermal, or, in general, elasticity properties. The classical simulation-based approach, which uses, e.g., finite elements and FFT-based solvers, can require substantial computational resources. We propose a novel spectral normalization scheme that a priori enforces these bounds.
  arXiv  Detail & Related papers  (2025-04-01T12:21:57Z)
• Quantum computer formulation of the FKP-operator eigenvalue problem for probabilistic learning on manifolds [0.0]
  We present a quantum computing formulation to address a challenging problem in the development of probabilistic learning on manifold (PLoM)<n>It involves solving the spectral problem of the high-dimensional Fokker-Planck operator, which remains beyond the reach of classical computing.<n>Explicit formulas for the Laplacian and potential are derived and mapped onto qubits using Pauli matrix expressions.
  arXiv  Detail & Related papers  (2025-02-20T14:05:16Z)
• GausSim: Foreseeing Reality by Gaussian Simulator for Elastic Objects [55.02281855589641]
  GausSim is a novel neural network-based simulator designed to capture the dynamic behaviors of real-world elastic objects represented through Gaussian kernels. We leverage continuum mechanics and treat each kernel as a Center of Mass System (CMS) that represents continuous piece of matter. In addition, GausSim incorporates explicit physics constraints, such as mass and momentum conservation, ensuring interpretable results and robust, physically plausible simulations.
  arXiv  Detail & Related papers  (2024-12-23T18:58:17Z)
• QKAN: Quantum Kolmogorov-Arnold Networks [0.6597195879147557]
  A new neural network architecture, called Kolmogorov-Arnold Networks (KAN), has emerged, inspired by the compositional structure of the Kolmogorov-Arnold representation theorem. Our QKAN exploits powerful quantum linear algebra tools, including quantum singular value transformation, to apply parameterized activation functions on the edges of the network. QKAN is based on block-encodings, making it inherently suitable for direct quantum input.
  arXiv  Detail & Related papers  (2024-10-06T10:11:57Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Leveraging SPD Matrices on Riemannian Manifolds in Quantum Classical Hybrid Models for Structural Health Monitoring [0.0]
  Realtime finite element modeling of bridges assists modern structural health monitoring systems by providing comprehensive insights into structural integrity. FEM computational cost and the need for realtime analysis pose significant challenges. In this study, we propose a novel hybrid quantum classical Multilayer Perceptron pipeline.
  arXiv  Detail & Related papers  (2024-06-06T13:21:28Z)
• Variational Quantum Framework for Partial Differential Equation Constrained Optimization [0.6138671548064355]
  We present a novel variational quantum framework for PDE constrained optimization problems. The proposed framework utilizes the variational quantum linear (VQLS) algorithm and a black box as its main building blocks.
  arXiv  Detail & Related papers  (2024-05-26T18:06:43Z)
• Quantum-informed simulations for mechanics of materials: DFTB+MBD framework [40.83978401377059]
  We study how quantum effects can modify the mechanical properties of systems relevant to materials engineering. We provide an open-source repository containing all codes, datasets, and examples presented in this work.
  arXiv  Detail & Related papers  (2024-04-05T16:59:01Z)
• Mechanistic Design and Scaling of Hybrid Architectures [114.3129802943915]
  We identify and test new hybrid architectures constructed from a variety of computational primitives. We experimentally validate the resulting architectures via an extensive compute-optimal and a new state-optimal scaling law analysis. We find MAD synthetics to correlate with compute-optimal perplexity, enabling accurate evaluation of new architectures.
  arXiv  Detail & Related papers  (2024-03-26T16:33:12Z)
• Compositional Generative Inverse Design [69.22782875567547]
  Inverse design, where we seek to design input variables in order to optimize an underlying objective function, is an important problem. We show that by instead optimizing over the learned energy function captured by the diffusion model, we can avoid such adversarial examples. In an N-body interaction task and a challenging 2D multi-airfoil design task, we demonstrate that by composing the learned diffusion model at test time, our method allows us to design initial states and boundary shapes.
  arXiv  Detail & Related papers  (2024-01-24T01:33:39Z)
• Variational quantum-algorithm based self-consistent calculations for the two-site DMFT model on noisy quantum computing hardware [0.0]
  We present a QC approach to solve a two-site DMFT model based on the Variational Quantum Eigensolver (VQE) algorithm.<n>We analyse the propagation of stachastic and device errors through the algorithm and their effects on the calculated self-energy.
  arXiv  Detail & Related papers  (2023-11-17T09:05:31Z)
• Explainable Equivariant Neural Networks for Particle Physics: PELICAN [51.02649432050852]
  PELICAN is a novel permutation equivariant and Lorentz invariant aggregator network. We present a study of the PELICAN algorithm architecture in the context of both tagging (classification) and reconstructing (regression) Lorentz-boosted top quarks. We extend the application of PELICAN to the tasks of identifying quark-initiated vs.gluon-initiated jets, and a multi-class identification across five separate target categories of jets.
  arXiv  Detail & Related papers  (2023-07-31T09:08:40Z)
• Measurement-based infused circuits for variational quantum eigensolvers [1.732837834702512]
  Variational quantum eigensolvers (VQEs) are successful algorithms for studying physical systems on quantum computers. In this work, we incorporate such ideas into traditional VQE circuits. We showcase our approach on real superconducting quantum computers by performing VQE simulations of testbed systems.
  arXiv  Detail & Related papers  (2023-05-30T16:45:54Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Optimizing Design Choices for Neural Quantum States [0.0]
  We present a comparison of a selection of popular network architectures and symmetrization schemes employed for ground state searches of spin Hamiltonians. In the presence of a non-trivial sign structure of the ground states, we find that the details of symmetrization crucially influence the performance.
  arXiv  Detail & Related papers  (2023-01-17T10:30:05Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• PELICAN: Permutation Equivariant and Lorentz Invariant or Covariant Aggregator Network for Particle Physics [64.5726087590283]
  We present a machine learning architecture that uses a set of inputs maximally reduced with respect to the full 6-dimensional Lorentz symmetry. We show that the resulting network outperforms all existing competitors despite much lower model complexity.
  arXiv  Detail & Related papers  (2022-11-01T13:36:50Z)
• A Pareto-optimal compositional energy-based model for sampling and optimization of protein sequences [55.25331349436895]
  Deep generative models have emerged as a popular machine learning-based approach for inverse problems in the life sciences. These problems often require sampling new designs that satisfy multiple properties of interest in addition to learning the data distribution.
  arXiv  Detail & Related papers  (2022-10-19T19:04:45Z)
• Towards near-term quantum simulation of materials [0.47780641233738846]
  Many quantum simulation algorithms rely on a layer of unitary evolutions generated by each term in a Hamiltonian. We present a new quantum algorithm design for materials modelling where the depth of a layer is independent of the system size. We analyse the circuit costs of this approach and present a compiler that transforms density functional theory data into quantum circuit instructions.
  arXiv  Detail & Related papers  (2022-05-30T17:07:00Z)
• 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)
• Solution to the Quantum Symmetric Simple Exclusion Process : the Continuous Case [0.0]
  We present a solution for the invariant probability measure of the one dimensional Q-SSEP in the infinite size limit. We incidentally point out a possible interpretation of the Q-SSEP correlation functions via a surprising conneatorics and the associahedron polytopes.
  arXiv  Detail & Related papers  (2020-06-22T13:20:40Z)

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.