Basis set generation and optimization in the NISQ era with Quiqbox.jl

• URL: http://arxiv.org/abs/2212.04586v2
• Date: Mon, 04 Nov 2024 22:07:47 GMT
• Title: Basis set generation and optimization in the NISQ era with Quiqbox.jl
• Authors: Weishi Wang, James D. Whitfield,
• Abstract summary: We propose a framework for more customizable basis set generation and optimization. We have developed an open-source software package named Quiqbox'' in the Julia programming language.
• Score: 2.909730313782505
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the noisy intermediate-scale quantum era, ab initio computation of the electronic structure problems has become one of the major benchmarks for identifying the boundary between classical and quantum computational power. Basis sets play a key role in the electronic structure methods implemented on both classical and quantum devices. To investigate the consequences of the single-particle basis sets, we propose a framework for more customizable basis set generation and optimization. This framework allows composite basis sets to go beyond typical basis set frameworks, such as atomic basis sets, by introducing the concept of mixed-contracted Gaussian-type orbitals. These basis set generations set the stage for more flexible variational optimization of basis set parameters. To realize this framework, we have developed an open-source software package named ``Quiqbox'' in the Julia programming language. We demonstrate various examples of using Quiqbox for basis set optimization and generation, ranging from optimizing atomic basis sets on the Hartree--Fock level, preparing the initial state for VQE computation, and constructing basis sets with completely delocalized orbitals. We also include various benchmarks of Quiqbox for basis set optimization and ab initial electronic structure computation.

Related papers

• FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture [9.755713238528779]
  FTCircuitBench serves as a benchmark suite of impactful quantum algorithms.<n>A modular end-to-end pipeline allows users to compile and decompose algorithms for various fault-tolerant architectures.<n>A toolkit provides detailed numerical analysis at each stage.
  arXiv  Detail & Related papers  (2026-01-06T17:08:46Z)
• Benchmarking VQE Configurations: Architectures, Initializations, and Optimizers for Silicon Ground State Energy [0.0]
  This work investigates the performance of the Variational Quantumsolver (VQE) in estimating the ground-state energy of the silicon atom.<n>Within a hybrid quantum-classical optimization framework, we implement VQE using a range of ansatz, including Double Excitation Gates, ParticleConservingU2, UCCSD, and k-UpCCGSD.<n>The main contribution of this work lies in a systematic exploration of how these configuration choices interact to influence VQE performance.
  arXiv  Detail & Related papers  (2025-10-27T09:57:26Z)
• Fast adaptive discontinuous basis sets for electronic structure [1.7188280334580195]
  We develop a Galerkin framework for automatically constructing adaptive basis sets for electronic structure calculations.<n>By allowing combinations of element sets, we maintain favorable numerical conditioning and induce structured sparsity of integral solvers.<n>These basis sets naturally support adaptive multigrid preconditioning for the linear eigensolvers employed within the self-consistent field for Hartree-Fock and density functional theory.
  arXiv  Detail & Related papers  (2025-10-24T07:33:48Z)
• Numerical Optimization Methods in the environment with Quantum Noise [0.0]
  This thesis focuses on the State-Averaged Orbital-d Variational Quantumsolver (SAOOVQE)<n>This hybrid quantum-classical algorithm provides a balanced description of multiple electronic states.<n>A comparative study against classical algorithms like the Broyden-Fletcher-Goldfarb-Shanno (BFGS) and Sequential Squares Programming (SLSQP)<n>Results show that orbital optimization is essential for correctly capturing the potential energy surface.
  arXiv  Detail & Related papers  (2025-09-15T19:00:27Z)
• QB Ground State Energy Estimation Benchmark [30.045562070102537]
  Ground State Energy Estimation is a central problem in quantum chemistry and condensed matter physics.<n>This work introduces a structured benchmarking framework for evaluating the performance of both classical and quantum solvers.
  arXiv  Detail & Related papers  (2025-08-14T17:45:28Z)
• Spectra-to-Structure and Structure-to-Spectra Inference Across the Periodic Table [60.78615287040791]
  XAStruct is a learning framework capable of both predicting XAS spectra from crystal structures and inferring local structural descriptors from XAS input.<n>XAStruct is trained on a large-scale dataset spanning over 70 elements across the periodic table.
  arXiv  Detail & Related papers  (2025-06-13T15:58:05Z)
• An Efficient Quantum Approximate Optimization Algorithm with Fixed Linear Ramp Schedule for Truss Structure Optimization [0.0]
  This study proposes a novel structural optimization framework based on quantum variational circuits. By defining design variables as multipliers, it provides greater flexibility in adjusting the cross-sectional area of the rod. As a result, the objective function is in a simple format, enabling efficient optimization using QAOA.
  arXiv  Detail & Related papers  (2025-02-24T01:19:41Z)
• BenchQC: A Benchmarking Toolkit for Quantum Computation [0.4037357056611557]
  Variational Quantum Eigensolver (VQE) is a promising algorithm for quantum computing applications in chemistry and materials science. This study benchmarks the performance of the VQE for calculating ground-state energies of aluminum clusters.
  arXiv  Detail & Related papers  (2025-02-13T18:51:08Z)
• Qompose: A Technique to Select Optimal Algorithm- Specific Layout for Neutral Atom Quantum Architectures [10.264543064788711]
  We propose, Qompose, a neutral atom quantum computing framework for efficiently composing quantum circuits on 2-D topologies of neutral atoms. Our evaluation demonstrates Qompose is effective for a large collection of randomly-generated quantum circuits and a range of real-world benchmarks.
  arXiv  Detail & Related papers  (2024-09-29T23:03:08Z)
• Evolving a multi-population evolutionary-QAOA on distributed QPUs [0.0]
  We benchmark this Evolutionary-QAOA (E-QAOA) approach on the Max-Cut problem for $d$-3 regular graphs of 4 to 26 nodes.<n>We propose a novel distributed multi-population EA strategy, executing parallel, independent populations on two quantum processing units.
  arXiv  Detail & Related papers  (2024-09-16T21:16:51Z)
• Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation [3.9857517408503567]
  Quantum Approximate optimisation algorithm (qaoa) is a widely studied quantum-classical iterative for optimisation. We introduce a new algorithmic variant based on non-iterative computation that is instance-independent, but problem-specific. Our approach is based on proving a long-standing conjecture regarding quantum-independent structures in qaoa.
  arXiv  Detail & Related papers  (2024-08-12T21:02:58Z)
• 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)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• 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)
• 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)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• A quantum-classical cloud platform optimized for variational hybrid algorithms [0.0]
  This work enumerates the architectural requirements of a quantum-classical cloud platform. We present a framework for benchmarking its runtime performance. We show that integrating these two features into the Rigetti Quantum Cloud Services (QCS) platform results in considerable improvements to the latencies that govern algorithm runtime.
  arXiv  Detail & Related papers  (2020-01-13T18:37:01Z)

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.