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:1906.00476

Noise reduction using past causal cones in variational quantum algorithms

Omar Shehab, Isaac H. Kim, Nhung H. Nguyen, K. A. Landsman, C. Huerta Alderete, Daiwei Zhu, Christopher R. Monroe, Norbert M. Linke

Published Jun 2, 2019• 11 citations
arXivHTMLPDF

Abstract

We introduce an approach to improve the accuracy and reduce the sample complexity of near term quantum-classical algorithms. We construct a simpler initial parameterized quantum state, or ansatz, based on the past causal cone of each observable, generally yielding fewer qubits and gates. We implement this protocol on a trapped ion quantum computer and demonstrate improvement in accuracy and time-to-solution at an arbitrary point in the variational search space. We report a $\sim 27\%$ improvement in the accuracy of the calculation of the deuteron binding energy and $\sim 40\%$ improvement in the accuracy of the quantum approximate optimization of the MAXCUT problem applied to the dragon graph $T_{3,2}$. When the time-to-solution is prioritized over accuracy, the former requires $\sim 71\%$ fewer measurements and the latter requires $\sim 78\%$ fewer measurements.

DOI
10.48550/arxiv.1906.00476

Related papers

Filtering variational quantum algorithms for combinatorial optimization

David Amaro, Carlo Modica, Matthias Rosenkranz +3 more

Abstract Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the filtering variational quantum eigensolver which utilizes filtering operators to achieve faster and more reliable convergence to the optimal solution. Additionally we explore the use of causal cones to reduce the number of qubits required on a quantum computer. Using random weighted MaxCut problems, we numerically analyze our methods and show that they perform better than the original VQE algorithm and the quantum approximate optimization algorithm. We also demonstrate the experimental feasibility of our algorithms on a Quantinuum trapped-ion quantum processor powered by Honeywell.

arXiv:2106.10055•Quantum Science and Technology•Nov 29, 2021•121 citations

Hardware-efficient variational quantum algorithm in trapped-ion quantum computer

J. -Z. Zhuang, Y. -K. Wu, Duan, L. -M.

We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the dependence on resource-intensive two-qubit gates in conventional gate-based methods. We apply HEA-TI to state engineering of cluster states and analyze the scaling of required quantum resources. We also apply HEA-TI to solve the ground state problem of chemical molecules $\mathrm{H_{2}}$, $\mathrm{LiH}$ and $\mathrm{F_{2}}$. We numerically analyze the quantum computing resources required to achieve chemical accuracy and examine the performance under realistic experimental noise and statistical fluctuation. The efficiency of this ansatz is shown to be comparable to other commonly used variational ansatzes like UCCSD, with the advantage of substantially easier implementation in the trapped-ion quantum simulator. This approach showcases the hardware-efficient ansatz as a powerful tool for the application of the near-term quantum computer.

arXiv:2407.03116•Jul 3, 2024•0 citations

Variational Ansatz preparation to avoid CNOT-gates on noisy quantum devices for combinatorial optimizations

Tsukasa Miki, Ryo Okita, Moe Shimada +2 more

The variational quantum eigensolver (VQE), which is a quantum–classical hybrid approach, has latent powers to leverage near-term quantum devices by effectively managing a limited number of qubits with finite coherent lifetimes. While it is generally argued that the quantum approximate optimization algorithm (QAOA), which is a special case of VQE with a variational Ansatz based on the adiabatic theorem, may enable practical applications of noisy quantum devices for classical combinatorial optimizations, the strategy to improve the performance of this algorithm by increasing the circuit depth conflicts with the limited coherence time of near-term quantum devices. Here, we introduce strategies involving the VQE to reduce the circuit resources required for solving combinatorial optimizations. Our concept of a parameterized quantum circuit allows the Ansatz preparation to be achieved by only single-qubit operation. We find that the variational Ansatz without controlled X-gates leads to quick convergence in a classical subroutine used to determine the variational parameters. In addition, the variational Ansatz with optimized parameters maintains performance over the problem sizes both on the numerical simulation and IBM 27-qubit processor “ibm_kawasaki.” Therefore, the variational Ansatz introduced in this study has several advantages considering the total calculation time and performance scaling over the problem sizes. We also show that the variational Ansatz consisting of a lower number of gate operations than that of QAOA can approximate the eigenstates of diagonal Hamiltonians with high accuracy. We illustrate our ideas with a maximum-cut problem and show that near-term quantum applications may be feasible using short-depth circuits.

AIP Advances•Mar 1, 2022•16 citations

Performance guarantees of light-cone variational quantum algorithms for the maximum cut problem

Xiaoyang Wang, Yuexin Su, Tongyang Li

Abstract Variational quantum algorithms (VQAs) are promising to demonstrate the advantage of quantum computing over classical computing in practical applications, such as the maximum cut (MaxCut) problem. However, current VQAs such as the quantum approximate optimization algorithm (QAOA) have lower performance guarantees compared to the best-known classical algorithm, and suffer from hard optimization processes due to the barren plateau (BP) problem. We propose a light-cone VQA by choosing an optimal gate sequence of the standard VQAs, which enables a significant improvement in solution accuracy while avoiding the BP problem. Specifically, we prove that the light-cone VQA with one round achieves an approximation ratio of 0.7926 for the MaxCut problem in the worst case of 3 -regular graphs, which is higher than that of the 3-round QAOA, and can be further improved to 0.8333 by a multi-angle relaxation. We conduct systematic experiments to verify our theory. On the one hand, numerical simulations demonstrate that the light-cone VQA achieves better performance over the classical Goemans–Williamson algorithm and the CPLEX solver. On the other hand, we demonstrate on IBM’s quantum devices that the single-round light-cone VQA exceeds the known classical hardness threshold in both 72- and 148-qubit demonstrations, whereas QAOA fails in the 148-qubit one. This work highlights a promising route towards solving classically hard problems on practical quantum devices.

arXiv:2504.12896•Quantum Science and Technology•Aug 18, 2026•0 citations

A Comparative Study on Solving Optimization Problems With Exponentially Fewer Qubits

David Winderl, Nicola Franco, Jeanette Miriam Lorenz

Variational quantum optimization algorithms, such as the Variational Quantum Eigensolver (VQE) or the Quantum Approximate Optimization Algorithm (QAOA), are among the most studied quantum algorithms. In our work, we evaluate and improve an algorithm based on VQE, which uses exponentially fewer qubits compared to the QAOA. We highlight the numerical instabilities generated by encoding the problem into the variational ansatz and propose a classical optimization procedure to find the ground-state of the ansatz in less iterations with a better or similar objective. Additionally, we propose a method to embed the linear interpolation of the MaxCut problem on a quantum device. Furthermore, we compare classical optimizers for this variational ansatz on quadratic unconstrained binary optimization and graph partitioning problems.

IEEE Transactions on Quantum Engineering•Jan 1, 2024•5 citations

Performant near-term quantum combinatorial optimization

Titus Morris, Kaushik, Ananth, Roetteler, Martin +1 more

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational advantages. To address this we present a variational quantum algorithm for solving combinatorial optimization problems with linear-depth circuits. Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target combinatorial function, along with parameter updates following a modified version of quantum imaginary time evolution. We evaluate this ansatz in numerical simulations that target solutions to the MAXCUT problem. The state evolution is shown to closely mimic imaginary time evolution, and its optimal-solution convergence is further improved using adaptive transformations of the classical Hamiltonian spectrum. With these innovations, the algorithm consistently converges to optimal solutions, with interesting highly-entangled dynamics along the way. We further demonstrate the success of this approach by performing optimization of a truncated version of our ansatz with up to 32 qubits in a trapped-ion quantum computer, using measurements from the quantum computer to train the ansatz and prepare optimal solutions with high fidelity in the majority of cases we consider. The success of these large-scale quantum circuit optimizations, in the presence of realistic hardware constraints and without error mitigation, mark significant progress on the path towards solving combinatorial problems using quantum computers. We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.

arXiv:2404.16135•Apr 24, 2024•1 citation
We introduce an approach to improve the accuracy and reduce the sample complexity of near term quantum-classical algorithms. We construct a simpler initial parameterized quantum state, or ansatz, based on the past causal cone of each observable, generally yielding fewer qubits and gates. We implement this protocol on a trapped ion quantum computer and demonstrate improvement in accuracy and time-to-solution at an arbitrary point in the variational search space. We report a ∼27%\sim 27\%∼27% improvement in the accuracy of the calculation of the deuteron binding energy and ∼40%\sim 40\%∼40% improvement in the accuracy of the quantum approximate optimization of the MAXCUT problem applied to the dragon graph T3,2T_{3,2}T3,2​. When the time-to-solution is prioritized over accuracy, the former requires ∼71%\sim 71\%∼71% fewer measurements and the latter requires ∼78%\sim 78\%∼78% fewer measurements.
Abstract Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the filtering variational quantum eigensolver which utilizes filtering operators to achieve faster and more reliable convergence to the optimal solution. Additionally we explore the use of causal cones to reduce the number of qubits required on a quantum computer. Using random weighted MaxCut problems, we numerically analyze our methods and show that they perform better than the original VQE algorithm and the quantum approximate optimization algorithm. We also demonstrate the experimental feasibility of our algorithms on a Quantinuum trapped-ion quantum processor powered by Honeywell.
We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the dependence on resource-intensive two-qubit gates in conventional gate-based methods. We apply HEA-TI to state engineering of cluster states and analyze the scaling of required quantum resources. We also apply HEA-TI to solve the ground state problem of chemical molecules H2\mathrm{H_{2}}H2​, LiH\mathrm{LiH}LiH and F2\mathrm{F_{2}}F2​. We numerically analyze the quantum computing resources required to achieve chemical accuracy and examine the performance under realistic experimental noise and statistical fluctuation. The efficiency of this ansatz is shown to be comparable to other commonly used variational ansatzes like UCCSD, with the advantage of substantially easier implementation in the trapped-ion quantum simulator. This approach showcases the hardware-efficient ansatz as a powerful tool for the application of the near-term quantum computer.
The variational quantum eigensolver (VQE), which is a quantum–classical hybrid approach, has latent powers to leverage near-term quantum devices by effectively managing a limited number of qubits with finite coherent lifetimes. While it is generally argued that the quantum approximate optimization algorithm (QAOA), which is a special case of VQE with a variational Ansatz based on the adiabatic theorem, may enable practical applications of noisy quantum devices for classical combinatorial optimizations, the strategy to improve the performance of this algorithm by increasing the circuit depth conflicts with the limited coherence time of near-term quantum devices. Here, we introduce strategies involving the VQE to reduce the circuit resources required for solving combinatorial optimizations. Our concept of a parameterized quantum circuit allows the Ansatz preparation to be achieved by only single-qubit operation. We find that the variational Ansatz without controlled X-gates leads to quick convergence in a classical subroutine used to determine the variational parameters. In addition, the variational Ansatz with optimized parameters maintains performance over the problem sizes both on the numerical simulation and IBM 27-qubit processor “ibm_kawasaki.” Therefore, the variational Ansatz introduced in this study has several advantages considering the total calculation time and performance scaling over the problem sizes. We also show that the variational Ansatz consisting of a lower number of gate operations than that of QAOA can approximate the eigenstates of diagonal Hamiltonians with high accuracy. We illustrate our ideas with a maximum-cut problem and show that near-term quantum applications may be feasible using short-depth circuits.
Abstract Variational quantum algorithms (VQAs) are promising to demonstrate the advantage of quantum computing over classical computing in practical applications, such as the maximum cut (MaxCut) problem. However, current VQAs such as the quantum approximate optimization algorithm (QAOA) have lower performance guarantees compared to the best-known classical algorithm, and suffer from hard optimization processes due to the barren plateau (BP) problem. We propose a light-cone VQA by choosing an optimal gate sequence of the standard VQAs, which enables a significant improvement in solution accuracy while avoiding the BP problem. Specifically, we prove that the light-cone VQA with one round achieves an approximation ratio of 0.7926 for the MaxCut problem in the worst case of 3 -regular graphs, which is higher than that of the 3-round QAOA, and can be further improved to 0.8333 by a multi-angle relaxation. We conduct systematic experiments to verify our theory. On the one hand, numerical simulations demonstrate that the light-cone VQA achieves better performance over the classical Goemans–Williamson algorithm and the CPLEX solver. On the other hand, we demonstrate on IBM’s quantum devices that the single-round light-cone VQA exceeds the known classical hardness threshold in both 72- and 148-qubit demonstrations, whereas QAOA fails in the 148-qubit one. This work highlights a promising route towards solving classically hard problems on practical quantum devices.
Variational quantum optimization algorithms, such as the Variational Quantum Eigensolver (VQE) or the Quantum Approximate Optimization Algorithm (QAOA), are among the most studied quantum algorithms. In our work, we evaluate and improve an algorithm based on VQE, which uses exponentially fewer qubits compared to the QAOA. We highlight the numerical instabilities generated by encoding the problem into the variational ansatz and propose a classical optimization procedure to find the ground-state of the ansatz in less iterations with a better or similar objective. Additionally, we propose a method to embed the linear interpolation of the MaxCut problem on a quantum device. Furthermore, we compare classical optimizers for this variational ansatz on quadratic unconstrained binary optimization and graph partitioning problems.
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational advantages. To address this we present a variational quantum algorithm for solving combinatorial optimization problems with linear-depth circuits. Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target combinatorial function, along with parameter updates following a modified version of quantum imaginary time evolution. We evaluate this ansatz in numerical simulations that target solutions to the MAXCUT problem. The state evolution is shown to closely mimic imaginary time evolution, and its optimal-solution convergence is further improved using adaptive transformations of the classical Hamiltonian spectrum. With these innovations, the algorithm consistently converges to optimal solutions, with interesting highly-entangled dynamics along the way. We further demonstrate the success of this approach by performing optimization of a truncated version of our ansatz with up to 32 qubits in a trapped-ion quantum computer, using measurements from the quantum computer to train the ansatz and prepare optimal solutions with high fidelity in the majority of cases we consider. The success of these large-scale quantum circuit optimizations, in the presence of realistic hardware constraints and without error mitigation, mark significant progress on the path towards solving combinatorial problems using quantum computers. We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.