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

Variational preparation of thermofield double states for SYK models via multi-angle QAOA: sequential angle pruning for circuit reduction

Haji Muhammad Husnain Ashfaq, Moongul Byun, Keun-Young Kim

quant-phSubmitted Sep 2, 2026• Announced Sep 3, 2026• 0 citations
arXivHTMLPDF

Abstract

Variational preparation of thermofield double (TFD) states can require deep quantum circuits, particularly for interacting many-body systems. Reducing these circuits while retaining high fidelity is therefore crucial for TFD-state preparation on noisy quantum processors. We study this problem by applying the multi-angle quantum approximate optimization algorithm (ma-QAOA) to TFD-state preparation and introducing two top-down sequential angle-pruning algorithms. Starting from the optimized initial ma-QAOA circuit, both algorithms sequentially remove Pauli-string evolutions with small optimized angles and reoptimize the remaining parameters after each removal. We apply these algorithms to Gaussian and binary Sachdev--Ye--Kitaev (SYK) models in both dense and sparse cases. We find that ma-QAOA prepares the target TFD states with high fidelity and that sequential small-angle pruning retains high fidelity while reducing the circuit depth, particularly at low temperature. Moreover, using the post-reoptimization cost in sequential small-angle pruning further improves the fidelity. For the binary sparse $N=10$ SYK model at $β=10$, $88.8\%$--$92.1\%$ of the nonlocal Pauli-string evolutions are removed while retaining an average fidelity of approximately $95\%$. Finally, we propose extensions of the sequential pruning algorithms toward quantum--classical hybrid implementation.

Comments
17 pages, 10 figures

Related papers

Variational preparation of the thermofield double state of the Sachdev-Ye-Kitaev model

Vincent Paul Su

We provide an algorithm for preparing the thermofield double (TFD) state of the Sachdev-Ye-Kitaev (SYK) model without the need for an auxiliary bath. Following previous work, the TFD can be cast as the approximate ground state of a Hamiltonian, ${H}_{\text{TFD}}$. Using variational quantum circuits, we propose and implement a gradient-based algorithm for learning parameters that find this ground state, an application of the variational quantum eigensolver. Concretely, we find shallow quantum circuits that prepare the ground state of ${H}_{\text{TFD}}$ for the $q=4$ SYK model for $N=8$ Majoranas per side. For $N=12$, we achieve a variational energy within 1% of the true ground-state energy.

arXiv:2009.04488•Physical Review A•Jul 29, 2021•22 citations

Preparing High-Fidelity Thermofield Double States

Brian J. J. Khor, Nadie LiTenn, Martin Sasieta +1 more

A major promise of quantum computers is the controlled preparation of many-body quantum states beyond the reach of efficient classical computation. Among the most important targets are thermal mixed states and their thermofield double (TFD) purifications, which play central roles in quantum many-body physics and quantum gravity. For target systems with a bounded energy spectrum that obey the eigenstate thermalization hypothesis (ETH), we present a parent Hamiltonian built from two copies of the target Hamiltonian and ultra-local couplings between the copies, which we argue is gapped with a ground state that approximates a TFD state of the target Hamiltonian. By adiabatically evolving down from strong coupling, we can thus prepare a high-fidelity TFD state. We study two variants of the parent Hamiltonian using numerical methods in two classes of models: mixed field Ising models in one and two dimensions and non-local "spin Sachdev-Ye-Kitaev'' models. In the simpler variant, the parent Hamiltonian ground state has high overlap with a TFD for system sizes accessible to near-term quantum devices. However, the global overlap decays exponentially with the number of qubits, with a small error per degree of freedom. The second variant introduces an additional penalty term which can be tuned to reduce or remove the decay of the overlap with system size. Together with a general ETH-based analysis, these results suggest a broadly applicable method for TFD preparation that is not limited to particular temperatures or geometric locality.

quant-pharXiv:2605.03017•May 6, 2026•3 citations

Preparing a Thermofield Double State with Feedback Quantum Algorithms

Guilherme E. L. Pexe, Lucas A. M. Rattighieri, Felipe F. Fanchini +2 more

The efficient preparation of correlated thermal states, such as the Thermofield Double (TFD) state, is a fundamental prerequisite for simulating quantum gravity models and many-body thermodynamics on quantum processors. In this work, we investigate the ground state preparation of the Two Coupled Sachdev-Ye-Kitaev model, known as the Maldacena-Qi model, which is dual to a traversable wormhole in $AdS_2$, utilizing feedback-based quantum algorithms. We demonstrate that the standard feedback-based quantum algorithm (FALQON) and its time-rescaled variant (TR-FALQON) face severe kinetic limitations in this system, failing to converge to the highly entangled ground state when initialized in trivial product states. To overcome these barriers, we propose the hybrid ITE-TR-FALQON protocol, which integrates the imaginary-time evolution present in imaginary-time-enhanced FALQON (ITE-FALQON) with the time-rescaling mechanism. Our numerical results indicate that the introduction of non-unitary dynamics is strictly necessary to break symmetry traps and filter out excited states, while time-rescaling drastically accelerates algorithm convergence. The proposed method achieves fidelities close to unity and reproduces the von Neumann and Rényi entropy spectra of the exact TFD state with high precision.

hep-thCross-listedarXiv:2607.01653•Physical review. D/Physical review. D.•Jul 3, 2026•0 citations

Improved Performance of Multi-Angle Quantum Approximate Optimization Algorithm (ma-QAOA) Compared to QAOA On Simulation and Experimental Hardware Platforms

Vandit Srivastava, P Rohith, Sanyam Singhal +1 more

Multi-angle quantum approximate optimization algorithm (ma-QAOA) has been proposed as an alternative to regular QAOA for solving optimization problems using noisy intermediate scale quantum (NISQ) hardware. Here, we first implement QAOA and ma-QAOA algorithms to solve MaxCut on weighted and unweighted versions of the Erdős–Rényi (ER) and random cubic (RC) graphs of 6 and 10 nodes. Quantum circuit parameters are updated iteratively through classical feedback with the quantum circuit for forward pass modelled on Qiskit simulator without noise models. Then, the quantum circuit for the final run with updated parameters is implemented on Qiskit simulator without noise models, Qiskit simulator with experimentally benchmarked noise models (fake back-end), and also on actual experimental quantum hardware (IBM’s 127-qubit quantum processor ibm brisbane). We show that for most graph instances, ma-QAOA performs better than QAOA (in terms of approximation ratio (AR)) and needs less stages in the quantum circuit for all three aforementioned methods. Finally, we extend our results up to 14-node RC graphs while restricting ourselves to Qiskit simulation without noise (both for parameter update and final run) and show that for most instances, ma-QAOA again needs much less stages compared to QAOA to obtain reasonable AR.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 6, 2025•4 citations

SAFE ma-QAOA: Surrogate-Assisted and Fine-Tuning Enhanced Multi-Angle QAOA with Parameter Distillation

Hyunwoo Kim, Youngseok Lee

The multi-angle Quantum Approximate Optimization Algorithm (ma-QAOA) extends the Quantum Approximate Optimization Algorithm (QAOA) by assigning a larger number of independent variational parameters, thereby increasing expressivity and improving performance at low circuit depths. However, this larger parameterization makes training more difficult and requires repeated circuit evaluations for gradient-based optimization. In this work, we propose the Surrogate-Assisted and Fine-tuning Enhanced (SAFE) framework. SAFE first uses Low-Weight Pauli Propagation (LWPP) as a classical surrogate for pre-training ma-QAOA parameters before exact optimization. SAFE then applies parameter distillation, which removes angles that remain near zero after surrogate pre-training. Finally, SAFE performs exact fine-tuning by optimizing the remaining active parameters using the exact energy objective. We evaluate SAFE on instances of the Sherrington-Kirkpatrick model, two-dimensional square-lattice spin glass, and Max-Cut. SAFE with distillation provides the strongest overall results relative to exact-only: (i) a 64.3 percent reduction in active parameter count and (ii) a 94.5 percent reduction in estimated QPU workload. Within the SAFE workflow, adding distillation further reduces the optimizer steps to the near-optimal regime by 44.4 percent relative to without distillation. These results provide evidence that SAFE ma-QAOA can accelerate convergence to high-quality solutions while reducing the required quantum resources for exact fine-tuning, offering a resource-efficient route toward expressive ma-QAOA on NISQ hardware.

quant-pharXiv:2605.23377•May 25, 2026•2 citations

Double-bracket quantum algorithms for thermal state preparation

Andrew Wright, Reyhaneh Aghaei Saem, Supanut Thanasilp +2 more

We propose quantum algorithms for preparing thermal states via the simulation of the thermofield double states. The key idea is to leverage double-bracket quantum algorithms to implement imaginary-time evolution on thermofield double states, whose reduced state realizes the Gibbs state. Our method, termed double-bracket thermofield double (DB-TFD), introduces two variants. The first, the vanilla DB-TFD algorithm, directly implements imaginary-time evolution using double-bracket quantum imaginary-time evolution. The second, poly DB-TFD, employs double-bracket quantum signal processing to approximate the imaginary-time evolution operator via a polynomial transformation. We demonstrate that the complexity of the poly DB-TFD algorithm scales exponentially with the inverse temperature in a broad practical regime. This scaling is consistent with existing methods, and numerical simulations support the corresponding theoretical bound. We further demonstrate the utility of DB-TFD in quantum Boltzmann machines for generative modeling, achieving improved performance compared with variational imaginary-time evolution approaches. These results establish DB-TFD as a promising route for thermal state preparation in the near-term and early-fault-tolerant regimes.

quant-pharXiv:2606.05947•Jun 5, 2026•3 citations
Variational preparation of thermofield double (TFD) states can require deep quantum circuits, particularly for interacting many-body systems. Reducing these circuits while retaining high fidelity is therefore crucial for TFD-state preparation on noisy quantum processors. We study this problem by applying the multi-angle quantum approximate optimization algorithm (ma-QAOA) to TFD-state preparation and introducing two top-down sequential angle-pruning algorithms. Starting from the optimized initial ma-QAOA circuit, both algorithms sequentially remove Pauli-string evolutions with small optimized angles and reoptimize the remaining parameters after each removal. We apply these algorithms to Gaussian and binary Sachdev--Ye--Kitaev (SYK) models in both dense and sparse cases. We find that ma-QAOA prepares the target TFD states with high fidelity and that sequential small-angle pruning retains high fidelity while reducing the circuit depth, particularly at low temperature. Moreover, using the post-reoptimization cost in sequential small-angle pruning further improves the fidelity. For the binary sparse N=10N=10N=10 SYK model at β=10β=10β=10, 88.8%88.8\%88.8%--92.1%92.1\%92.1% of the nonlocal Pauli-string evolutions are removed while retaining an average fidelity of approximately 95%95\%95%. Finally, we propose extensions of the sequential pruning algorithms toward quantum--classical hybrid implementation.
We provide an algorithm for preparing the thermofield double (TFD) state of the Sachdev-Ye-Kitaev (SYK) model without the need for an auxiliary bath. Following previous work, the TFD can be cast as the approximate ground state of a Hamiltonian, HTFD{H}_{\text{TFD}}HTFD​. Using variational quantum circuits, we propose and implement a gradient-based algorithm for learning parameters that find this ground state, an application of the variational quantum eigensolver. Concretely, we find shallow quantum circuits that prepare the ground state of HTFD{H}_{\text{TFD}}HTFD​ for the q=4q=4q=4 SYK model for N=8N=8N=8 Majoranas per side. For N=12N=12N=12, we achieve a variational energy within 1% of the true ground-state energy.
A major promise of quantum computers is the controlled preparation of many-body quantum states beyond the reach of efficient classical computation. Among the most important targets are thermal mixed states and their thermofield double (TFD) purifications, which play central roles in quantum many-body physics and quantum gravity. For target systems with a bounded energy spectrum that obey the eigenstate thermalization hypothesis (ETH), we present a parent Hamiltonian built from two copies of the target Hamiltonian and ultra-local couplings between the copies, which we argue is gapped with a ground state that approximates a TFD state of the target Hamiltonian. By adiabatically evolving down from strong coupling, we can thus prepare a high-fidelity TFD state. We study two variants of the parent Hamiltonian using numerical methods in two classes of models: mixed field Ising models in one and two dimensions and non-local "spin Sachdev-Ye-Kitaev'' models. In the simpler variant, the parent Hamiltonian ground state has high overlap with a TFD for system sizes accessible to near-term quantum devices. However, the global overlap decays exponentially with the number of qubits, with a small error per degree of freedom. The second variant introduces an additional penalty term which can be tuned to reduce or remove the decay of the overlap with system size. Together with a general ETH-based analysis, these results suggest a broadly applicable method for TFD preparation that is not limited to particular temperatures or geometric locality.
The efficient preparation of correlated thermal states, such as the Thermofield Double (TFD) state, is a fundamental prerequisite for simulating quantum gravity models and many-body thermodynamics on quantum processors. In this work, we investigate the ground state preparation of the Two Coupled Sachdev-Ye-Kitaev model, known as the Maldacena-Qi model, which is dual to a traversable wormhole in AdS2AdS_2AdS2​, utilizing feedback-based quantum algorithms. We demonstrate that the standard feedback-based quantum algorithm (FALQON) and its time-rescaled variant (TR-FALQON) face severe kinetic limitations in this system, failing to converge to the highly entangled ground state when initialized in trivial product states. To overcome these barriers, we propose the hybrid ITE-TR-FALQON protocol, which integrates the imaginary-time evolution present in imaginary-time-enhanced FALQON (ITE-FALQON) with the time-rescaling mechanism. Our numerical results indicate that the introduction of non-unitary dynamics is strictly necessary to break symmetry traps and filter out excited states, while time-rescaling drastically accelerates algorithm convergence. The proposed method achieves fidelities close to unity and reproduces the von Neumann and Rényi entropy spectra of the exact TFD state with high precision.
Multi-angle quantum approximate optimization algorithm (ma-QAOA) has been proposed as an alternative to regular QAOA for solving optimization problems using noisy intermediate scale quantum (NISQ) hardware. Here, we first implement QAOA and ma-QAOA algorithms to solve MaxCut on weighted and unweighted versions of the Erdős–Rényi (ER) and random cubic (RC) graphs of 6 and 10 nodes. Quantum circuit parameters are updated iteratively through classical feedback with the quantum circuit for forward pass modelled on Qiskit simulator without noise models. Then, the quantum circuit for the final run with updated parameters is implemented on Qiskit simulator without noise models, Qiskit simulator with experimentally benchmarked noise models (fake back-end), and also on actual experimental quantum hardware (IBM’s 127-qubit quantum processor ibm brisbane). We show that for most graph instances, ma-QAOA performs better than QAOA (in terms of approximation ratio (AR)) and needs less stages in the quantum circuit for all three aforementioned methods. Finally, we extend our results up to 14-node RC graphs while restricting ourselves to Qiskit simulation without noise (both for parameter update and final run) and show that for most instances, ma-QAOA again needs much less stages compared to QAOA to obtain reasonable AR.
The multi-angle Quantum Approximate Optimization Algorithm (ma-QAOA) extends the Quantum Approximate Optimization Algorithm (QAOA) by assigning a larger number of independent variational parameters, thereby increasing expressivity and improving performance at low circuit depths. However, this larger parameterization makes training more difficult and requires repeated circuit evaluations for gradient-based optimization. In this work, we propose the Surrogate-Assisted and Fine-tuning Enhanced (SAFE) framework. SAFE first uses Low-Weight Pauli Propagation (LWPP) as a classical surrogate for pre-training ma-QAOA parameters before exact optimization. SAFE then applies parameter distillation, which removes angles that remain near zero after surrogate pre-training. Finally, SAFE performs exact fine-tuning by optimizing the remaining active parameters using the exact energy objective. We evaluate SAFE on instances of the Sherrington-Kirkpatrick model, two-dimensional square-lattice spin glass, and Max-Cut. SAFE with distillation provides the strongest overall results relative to exact-only: (i) a 64.3 percent reduction in active parameter count and (ii) a 94.5 percent reduction in estimated QPU workload. Within the SAFE workflow, adding distillation further reduces the optimizer steps to the near-optimal regime by 44.4 percent relative to without distillation. These results provide evidence that SAFE ma-QAOA can accelerate convergence to high-quality solutions while reducing the required quantum resources for exact fine-tuning, offering a resource-efficient route toward expressive ma-QAOA on NISQ hardware.
We propose quantum algorithms for preparing thermal states via the simulation of the thermofield double states. The key idea is to leverage double-bracket quantum algorithms to implement imaginary-time evolution on thermofield double states, whose reduced state realizes the Gibbs state. Our method, termed double-bracket thermofield double (DB-TFD), introduces two variants. The first, the vanilla DB-TFD algorithm, directly implements imaginary-time evolution using double-bracket quantum imaginary-time evolution. The second, poly DB-TFD, employs double-bracket quantum signal processing to approximate the imaginary-time evolution operator via a polynomial transformation. We demonstrate that the complexity of the poly DB-TFD algorithm scales exponentially with the inverse temperature in a broad practical regime. This scaling is consistent with existing methods, and numerical simulations support the corresponding theoretical bound. We further demonstrate the utility of DB-TFD in quantum Boltzmann machines for generative modeling, achieving improved performance compared with variational imaginary-time evolution approaches. These results establish DB-TFD as a promising route for thermal state preparation in the near-term and early-fault-tolerant regimes.