The QuaST Decision Tree: Achieving Automation With Data-Based Recommendations

• URL: http://arxiv.org/abs/2605.18539v1
• Date: Mon, 18 May 2026 15:21:23 GMT
• Title: The QuaST Decision Tree: Achieving Automation With Data-Based Recommendations
• Abstract summary: Software tools for the development of quantum-enhanced algorithms are maturing.<n>End users need to be assisted in choosing the best combination of preprocessing, postprocessing, classical and quantum algorithms.<n>The QuaST Decision Tree reflects the complexity in combining individual decisions in its modular network structure.
• Score: 0.8749675983608171
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers are increasingly powerful. Software tools for the development of quantum-enhanced algorithms are maturing. However, the software stack still lacks the connection to applications that would enable hybrid algorithms combining classical and quantum computing steps. End users need to be assisted in choosing the best combination of preprocessing, postprocessing, classical and quantum algorithms options. The application-facing software stack is therefore required to cover problem modeling, encoding, algorithm selection and hyperparameter tuning. A variety of tools exist for specific recommendations. The QuaST Decision Tree reflects the complexity in combining individual decisions in its modular network structure, consisting of flexible computation nodes with modular recommendations. It can easily be configured to serve in an industrial solver, an HPC software stack, or for rapid prototyping in development. The key ingredient, automation, is delivered by modules. We present one such module judging the feasibility of variational algorithms based on a robust scalability analysis and classification of problem instances. The automation improves the performance of end-to-end solutions, highlights the benefit to be gained from the hybrid quantum solution, reduces expensive trial-and-error testing, and leads to an improved utilization of quantum devices for a practical benefit.

Related papers

• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering [41.94295877935867]
  We implement both quantum and classical solvers to compare their effectiveness.<n>For feature selection, we propose several QUBO configurations that balance feature importance and redundancy.<n>In instance selection, we propose a few novels for instance-level importance measures that extend existing methods.<n>For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement.
  arXiv  Detail & Related papers  (2025-07-20T17:59:14Z)
• Predict and Conquer: Navigating Algorithm Trade-offs with Quantum Design Automation [3.0189109720302207]
  We present a methodology to perform algorithm selection based on desirable non-functional requirements.<n>Based on the source code level, our framework traces key characteristics of quantum-classical algorithms.<n>We develop statistical models to quantify the influence of various factors on non-functional properties.
  arXiv  Detail & Related papers  (2025-07-09T11:36:13Z)
• Creating Automated Quantum-Assisted Solutions for Optimization Problems [0.0]
  We propose the QuaST decision tree, a framework that allows to explore, automate and evaluate solution paths.<n>Our setup is modular, highly structured and flexible enough to include any kind of preparation, pre-processing and post-processing steps.
  arXiv  Detail & Related papers  (2024-09-30T16:59:14Z)
• Approximating under the Influence of Quantum Noise and Compute Power [3.0302054726041017]
  The quantum approximate optimisation algorithm (QAOA) is at the core of many scenarios that aim to combine the power of quantum computers and classical high-performance computing appliances for optimisation. We study factors that affect solution quality and temporal behaviour of four QAOA variants using comprehensive density-matrix-based simulations. Our results, accompanied by a comprehensive reproduction package, show strong differences between QAOA variants that can be pinpointed to narrow and specific effects.
  arXiv  Detail & Related papers  (2024-08-05T07:48:49Z)
• Hybrid Meta-Solving for Practical Quantum Computing [0.0]
  This paper works towards the creation of an accessible hybrid software stack for solving optimization problems. We introduce a novel approach that we call Hybrid Meta-Solving, which combines classical and quantum optimization techniques.
  arXiv  Detail & Related papers  (2024-05-15T06:19:39Z)
• QPLEX: Realizing the Integration of Quantum Computing into Combinatorial Optimization Software [1.9109292348200242]
  Combinatorial optimization has emerged as one of the key target areas for quantum computers. In order to utilize quantum resources, users require domain-specific knowledge of quantum algorithms, SDKs and libraries. This paper presents a tool for the seamless utilization of quantum resources through a classical interface.
  arXiv  Detail & Related papers  (2023-07-26T17:18:07Z)
• 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)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.