Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2210.04639 · Scientific Reports

Variational quantum non-orthogonal optimization

Pablo Bermejo, Román Orús

Published Jun 17, 2023• 8 citations
arXivHTMLPDF

Abstract

Current universal quantum computers have a limited number of noisy qubits. Because of this, it is difficult to use them to solve large-scale complex optimization problems. In this paper we tackle this issue by proposing a quantum optimization scheme where discrete classical variables are encoded in non-orthogonal states of the quantum system. We develop the case of non-orthogonal qubit states, with individual qubits on the quantum computer handling more than one bit classical variable. Combining this idea with Variational Quantum Eigensolvers (VQE) and quantum state tomography, we show that it is possible to significantly reduce the number of qubits required by quantum hardware to solve complex optimization problems. We benchmark our algorithm by successfully optimizing a polynomial of degree 8 and 15 variables using only 15 qubits. Our proposal opens the path towards solving real-life useful optimization problems in today's limited quantum hardware.

DOI
10.1038/s41598-023-37068-2

Related papers

Combinatorial optimization with variational approaches on noisy quantum devices

Tsukasa Miki, Ryo Okita, Moe Shimada +1 more

Variational quantum eigensolver (VQE), a kind of quantum-classical hybrid method, has latent powers to leverage noisy quantum devices by effectively managing a limited number of qubits with finite coherent times. We implemented VQE with real quantum processors through IBM Quantum Experience and applied it to combinatorial optimizations. Notably, a short-depth quantum circuit consisting of a lower number of quantum gate than that in the quantum approximate optimization algorithm can search the ground states of diagonal Hamiltonians encoding the problems. Since the simplest case of the quantum circuit for VQE requires only single-qubit gates, it can be realized using current quantum computers.

IEEE International Conference on Manipulation, Manufacturing and Measurement on the Nanoscale (3M-NANO)•Aug 2, 2021•1 citation

Optimization of the variational quantum eigensolver for quantum chemistry applications

Robert de Keijzer, V. E. Colussi, Boris Škorić +1 more

This work studies the variational quantum eigensolver (VQE) algorithm, which is designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. Two methods of reducing the number of required qubit manipulations, prone to induce errors, for the variational quantum eigensolver are studied. First, we formally justify the multiple ℤ2 symmetry qubit reduction scheme first sketched by Bravyi et al. [arXiv:1701.08213 (2017)]. Second, we show that even in small, but non-trivial systems such as H2, LiH, and H2O, the choice of entangling methods (gate based or native) gives rise to varying rates of convergence to the ground state of the system. Through both the removal of qubits and the choice of entangler, the demands on the quantum hardware can be reduced. We find that in general, analyzing the VQE problem is complex, where the number of qubits, the method of entangling, and the depth of the search space all interact. In specific cases however, concrete results can be shown, and an entangling method can be recommended over others as it outperforms in terms of difference from the ground state energy.

arXiv:2102.01781•AVS Quantum Science•Feb 24, 2022•9 citations

Variational quantum and quantum-inspired clustering

Pablo Bermejo, Román Orús

Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum devices. The idea of the algorithm relies on reducing the clustering problem to an optimization, and then solving it via a Variational Quantum Eigensolver combined with non-orthogonal qubit states. In practice, the method uses maximally-orthogonal states of the target Hilbert space instead of the usual computational basis, allowing for a large number of clusters to be considered even with few qubits. We benchmark the algorithm with numerical simulations using real datasets, showing excellent performance even with one single qubit. Moreover, a tensor network simulation of the algorithm implements, by construction, a quantum-inspired clustering algorithm that can run on current classical hardware.

arXiv:2206.09893•Scientific Reports•Aug 16, 2023•23 citations

Variational Quantum Continuous Optimization: a Cornerstone of Quantum Mathematical Analysis

Bermejo, Pablo, Román Orús

Here we show how universal quantum computers based on the quantum circuit model can handle mathematical analysis calculations for functions with continuous domains, without any digitalization, and with remarkably few qubits. The basic building block of our approach is a variational quantum circuit where each qubit encodes up to three continuous variables (two angles and one radious in the Bloch sphere). By combining this encoding with quantum state tomography, a variational quantum circuit of $n$ qubits can optimize functions of up to $3n$ continuous variables in an analog way. We then explain how this quantum algorithm for continuous optimization is at the basis of a whole toolbox for mathematical analysis on quantum computers. For instance, we show how to use it to compute arbitrary series expansions such as, e.g., Fourier (harmonic) decompositions. In turn, Fourier analysis allows us to implement essentially any task related to function calculus, including the evaluation of multidimensional definite integrals, solving (systems of) differential equations, and more. To prove the validity of our approach, we provide benchmarking calculations for many of these use-cases implemented on a quantum computer simulator. The advantages with respect to classical algorithms for mathematical analysis, as well as perspectives and possible extensions, are also discussed.

arXiv:2210.03136•Oct 6, 2022•9 citations

Hybrid Quantum-Classical Computing: Benchmarking Algorithm Performance on Near-Term Quantum Processors for Optimization Problems

Alvira Nursahira, Reni Safitri, Muhammad Alvin +3 more

This paper presents a qualitative analysis of hybrid quantum-classical computing approaches aimed at solving complex optimization problems using near-term quantum processors. Hybrid algorithms leverage the strengths of quantum and classical computing to tackle computationally intensive tasks often constrained by current quantum hardware limitations. Through an extensive literature review and synthesis of recent empirical studies, we benchmark various hybrid algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE), focusing on their performance, scalability, and practical applicability on noisy intermediate-scale quantum (NISQ) devices. The study highlights the advantages, challenges, and future prospects of integrating hybrid quantum-classical computation in optimization domains, providing a comprehensive framework and qualitative insights into benchmarking methodologies and critical performance metrics.

Jurnal Info Sains Informatika dan Sains•Aug 12, 2025•0 citations

Towards large-scale quantum optimization solvers with few qubits

Marco Sciorilli, Lucas Borges, Taylor L. Patti +4 more

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $$m={{\mathcal{O}}}({n}^{k})$$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m, respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices. Combinatorial optimization problems might be solvable more efficiently with quantum computing, but near-term quantum optimization solvers are limited in qubit size. Here, the authors propose and demonstrate a variational quantum algorithm that polynomially reduces the qubit overhead for applications like MaxCut.

arXiv:2401.09421•Nature Communications•Jan 8, 2025•72 citations
Current universal quantum computers have a limited number of noisy qubits. Because of this, it is difficult to use them to solve large-scale complex optimization problems. In this paper we tackle this issue by proposing a quantum optimization scheme where discrete classical variables are encoded in non-orthogonal states of the quantum system. We develop the case of non-orthogonal qubit states, with individual qubits on the quantum computer handling more than one bit classical variable. Combining this idea with Variational Quantum Eigensolvers (VQE) and quantum state tomography, we show that it is possible to significantly reduce the number of qubits required by quantum hardware to solve complex optimization problems. We benchmark our algorithm by successfully optimizing a polynomial of degree 8 and 15 variables using only 15 qubits. Our proposal opens the path towards solving real-life useful optimization problems in today's limited quantum hardware.
Variational quantum eigensolver (VQE), a kind of quantum-classical hybrid method, has latent powers to leverage noisy quantum devices by effectively managing a limited number of qubits with finite coherent times. We implemented VQE with real quantum processors through IBM Quantum Experience and applied it to combinatorial optimizations. Notably, a short-depth quantum circuit consisting of a lower number of quantum gate than that in the quantum approximate optimization algorithm can search the ground states of diagonal Hamiltonians encoding the problems. Since the simplest case of the quantum circuit for VQE requires only single-qubit gates, it can be realized using current quantum computers.
This work studies the variational quantum eigensolver (VQE) algorithm, which is designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. Two methods of reducing the number of required qubit manipulations, prone to induce errors, for the variational quantum eigensolver are studied. First, we formally justify the multiple ℤ2 symmetry qubit reduction scheme first sketched by Bravyi et al. [arXiv:1701.08213 (2017)]. Second, we show that even in small, but non-trivial systems such as H2, LiH, and H2O, the choice of entangling methods (gate based or native) gives rise to varying rates of convergence to the ground state of the system. Through both the removal of qubits and the choice of entangler, the demands on the quantum hardware can be reduced. We find that in general, analyzing the VQE problem is complex, where the number of qubits, the method of entangling, and the depth of the search space all interact. In specific cases however, concrete results can be shown, and an entangling method can be recommended over others as it outperforms in terms of difference from the ground state energy.
Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum devices. The idea of the algorithm relies on reducing the clustering problem to an optimization, and then solving it via a Variational Quantum Eigensolver combined with non-orthogonal qubit states. In practice, the method uses maximally-orthogonal states of the target Hilbert space instead of the usual computational basis, allowing for a large number of clusters to be considered even with few qubits. We benchmark the algorithm with numerical simulations using real datasets, showing excellent performance even with one single qubit. Moreover, a tensor network simulation of the algorithm implements, by construction, a quantum-inspired clustering algorithm that can run on current classical hardware.
Here we show how universal quantum computers based on the quantum circuit model can handle mathematical analysis calculations for functions with continuous domains, without any digitalization, and with remarkably few qubits. The basic building block of our approach is a variational quantum circuit where each qubit encodes up to three continuous variables (two angles and one radious in the Bloch sphere). By combining this encoding with quantum state tomography, a variational quantum circuit of nnn qubits can optimize functions of up to 3n3n3n continuous variables in an analog way. We then explain how this quantum algorithm for continuous optimization is at the basis of a whole toolbox for mathematical analysis on quantum computers. For instance, we show how to use it to compute arbitrary series expansions such as, e.g., Fourier (harmonic) decompositions. In turn, Fourier analysis allows us to implement essentially any task related to function calculus, including the evaluation of multidimensional definite integrals, solving (systems of) differential equations, and more. To prove the validity of our approach, we provide benchmarking calculations for many of these use-cases implemented on a quantum computer simulator. The advantages with respect to classical algorithms for mathematical analysis, as well as perspectives and possible extensions, are also discussed.
This paper presents a qualitative analysis of hybrid quantum-classical computing approaches aimed at solving complex optimization problems using near-term quantum processors. Hybrid algorithms leverage the strengths of quantum and classical computing to tackle computationally intensive tasks often constrained by current quantum hardware limitations. Through an extensive literature review and synthesis of recent empirical studies, we benchmark various hybrid algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE), focusing on their performance, scalability, and practical applicability on noisy intermediate-scale quantum (NISQ) devices. The study highlights the advantages, challenges, and future prospects of integrating hybrid quantum-classical computation in optimization domains, providing a comprehensive framework and qualitative insights into benchmarking methodologies and critical performance metrics.
Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over m=O(nk)m={{\mathcal{O}}}({n}^{k})m=O(nk) binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m, respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices. Combinatorial optimization problems might be solvable more efficiently with quantum computing, but near-term quantum optimization solvers are limited in qubit size. Here, the authors propose and demonstrate a variational quantum algorithm that polynomially reduces the qubit overhead for applications like MaxCut.