arXiv subjects

Bhuvanesh Sundar

Publications and source records attributed to Bhuvanesh Sundar.

At least 19 recordsLinked to original sources

arXiv2026

Quantum Preconditioning For Constrained Optimization Problems

We study the effect of quantum preconditioning on constrained combinatorial optimization problems, focusing on balanced graph bi-partitioning. The proposed approach uses two-point correlations between decision variables derived from the Quantum Approximate Optimization Algorithm (QAOA) to construct a modified objective function that is subsequently provided to mixed-integer programming (MIP) solvers. The preconditioned MIP formulation retains the original hard constraint, and all incumbent solutions are evaluated under the original objective. Computational experiments on dense, weighted complete-graph instances show that the preconditioned problem instances reach near-optimal solutions faster, with most of the benefit already realized at the shallowest QAOA depth tested. Solver callback trajectories show this arises from earlier discovery of high-quality incumbents during the solution search. These results support a hybrid optimization framework in which quantum algorithms provide problem-specific information to guide classical exact MIP solvers.

quant-ph↗

arXiv2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

quant-ph↗

arXiv2026

Many-Body Effects in Dark-State Laser Cooling

We develop a unified many-body theory of two-photon dark-state laser cooling, the workhorse for preparing trapped ions close to their motional quantum ground state. For ions with a $\Lambda$ level structure, driven by Raman lasers, we identify an ion-number-dependent crossover between weak and strong coupling where both the cooling rate and final temperature are simultaneously optimized. We obtain simple analytic results in both extremes: In the weak coupling limit, we show a Lorentzian spin-absorption spectrum determines the cooling rate and final occupation of the motional state, which are both independent of the number of ions. We also highlight the benefit of including an additional spin dependent force in this case. In the strong coupling regime, our theory reveals the role of collective dynamics arising from phonon exchange between dark and bright states, allowing us to explain the enhancement of the cooling rate with increasing ion number. Our analytic results agree closely with exact numerical simulations and provide experimentally accessible guidelines for optimizing cooling in large ion crystals, a key step toward scalable, high-fidelity trapped-ion quantum technologies.

quant-ph↗

arXiv2025

Simulating plasma wave propagation on a superconducting quantum chip

Quantum computers may one day enable the efficient simulation of strongly coupled plasmas that lie beyond the reach of classical computation in regimes where quantum effects are important and the scale separation is large. In this article, we take a first step toward efficient simulation of quantum plasmas by demonstrating linear plasma wave propagation on a superconducting quantum chip. Using high-fidelity and highly expressive device-native gates, combined with an error-mitigation technique, we simulate the scattering of laser pulses from inhomogeneous plasmas. Our approach is made feasible by the identification of a suitable local spin model whose excitations mimic plasma waves, and whose circuit implementation requires a lower gate count than other proposed approaches that would require a future fault-tolerant quantum computer. This work opens avenues to study more complicated phenomena that cannot be simulated efficiently on classical computers, such as nonlinear quantum dynamics when strongly coupled plasmas are driven out of equilibrium.

quant-ph↗

arXiv2025

Optimization via Quantum Preconditioning

State-of-the-art classical optimization solvers set a high bar for quantum computers to deliver utility in this domain. Here, we introduce a quantum preconditioning approach based on the quantum approximate optimization algorithm. It transforms the input problem into a more suitable form for a solver with the level of preconditioning determined by the depth of the quantum circuit. We demonstrate that best-in-class classical heuristics such as simulated annealing and the Burer-Monteiro algorithm can converge more rapidly when given quantum preconditioned input for various problems, including Sherrington-Kirkpatrick spin glasses, random 3-regular graph maximum-cut problems, and a real-world grid energy problem. Accounting for the additional time taken for preconditioning, the benefit offered by shallow circuits translates into a practical quantum-inspired advantage for random 3-regular graph maximum-cut problems through quantum circuit emulations. We investigate why quantum preconditioning makes the problem easier and test an experimental implementation on a superconducting device. We identify challenges and discuss the prospects for a hardware-based quantum advantage in optimization via quantum preconditioning.

quant-ph↗

arXiv2024

A Multilevel Approach For Solving Large-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one of the promising candidates for useful quantum computation, particularly in the context of finding approximate solutions to Quadratic Unconstrained Binary Optimization (QUBO) problems. However, the existing quantum processing units (QPUs) are relatively small, and canonical mappings of QUBO via the Ising model require one qubit per variable, rendering direct large-scale optimization infeasible. In classical optimization, a general strategy for addressing many large-scale problems is via multilevel/multigrid methods, where the large target problem is iteratively coarsened, and the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentally test how existing QPUs perform as a sub-solver within such a multilevel strategy. We combine and extend (via additional classical processing) the recent Noise-Directed Adaptive Remapping (NDAR) and Quantum Relax $\&$ Round (QRR) algorithms. We first demonstrate the effectiveness of our heuristic extensions on Rigetti's transmon device Ankaa-2. We find approximate solutions to $10$ instances of fully connected $82$-qubit Sherrington-Kirkpatrick graphs with random integer-valued coefficients obtaining normalized approximation ratios (ARs) in the range $\sim 0.98-1.0$, and the same class with real-valued coefficients (ARs $\sim 0.94-1.0$). Then, we implement the extended NDAR and QRR algorithms as subsolvers in the multilevel algorithm for $6$ large-scale graphs with at most $\sim 27,000$ variables. The QPU (with classical post-processing steps) is used to find approximate solutions to dozens of problems, at most $82$-qubit, which are iteratively used to construct the global solution. We observe that quantum optimization results are competitive regarding the quality of solutions compared to classical heuristics used as subsolvers within the multilevel approach.

quant-ph↗

arXiv2024

Qubit-efficient quantum combinatorial optimization solver

Quantum optimization solvers typically rely on one-variable-to-one-qubit mapping. However, the low qubit count on current quantum computers is a major obstacle in competing against classical methods. Here, we develop a qubit-efficient algorithm that overcomes this limitation by mapping a candidate bit string solution to an entangled wave function of fewer qubits. We propose a variational quantum circuit generalizing the quantum approximate optimization ansatz (QAOA). Extremizing the ansatz for Sherrington-Kirkpatrick spin glass problems, we show valuable properties such as the concentration of ansatz parameters and derive performance guarantees. This approach could benefit near-term intermediate-scale and future fault-tolerant small-scale quantum devices.

quant-ph↗

arXiv2024

Generating Einstein$\unicode{x2013}$Podolsky$\unicode{x2013}$Rosen correlations for teleporting collective spin states in a two dimensional trapped ion crystal

We propose the use of phonon$\unicode{x2013}$mediated interactions as an entanglement resource to engineer Einstein$\unicode{x2013}$Podolsky$\unicode{x2013}$Rosen (EPR) correlations and to perform teleportation of collective spin states in two$\unicode{x2013}$dimensional ion crystals. We emulate continuous variable quantum teleportation protocols between subsystems corresponding to different nuclear spin degrees of freedom. In each of them, a quantum state is encoded in an electronic spin degree of freedom that couples to the vibrational modes of the crystal. We show that high fidelity teleportation of spin-coherent states and their phase-displaced variant, entangled spin-squeezed states, and Dicke states, is possible for realistic experimental conditions in arrays from a few tens to a few hundred ions.

quant-ph↗

arXiv2024

Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer

Achieving high-quality solutions faster than classical solvers on computationally hard problems is a challenge for quantum optimization to deliver utility. Using a superconducting quantum computer, we experimentally investigate the performance of a hybrid quantum-classical algorithm inspired by semidefinite programming approaches for solving the maximum-cut problem on 3-regular graphs up to several thousand variables. We leverage the structure of the input problems to address sizes beyond what current quantum machines can naively handle. We attain an average approximation ratio of 99% over a random ensemble of thousands of problem instances. We benchmark the quantum solver against similarly high-performing classical heuristics, including the Gurobi optimizer, simulated annealing, and the Burer-Monteiro algorithm. A run-time analysis shows that the quantum solver on large-scale problems is competitive against Gurobi but short of others on a projected 100-qubit quantum computer. We explore multiple leads to close the gap and discuss prospects for a practical quantum speedup.

quant-ph↗

arXiv2024

Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering

The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT problems (All-SAT). G-QAOA is less resource-intensive and more adaptable for 3-SAT and Max-SAT than Grover's algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

quant-ph↗

arXiv2023

Driven-dissipative four-mode squeezing of multilevel atoms in an optical cavity

We utilize multilevel atoms trapped in a driven resonant optical cavity to produce scalable multi-mode squeezed states for quantum sensing and metrology. While superradiance or collective dissipative emission by itself has been typically a detrimental effect for entanglement generation in optical cavities, in the presence of additional drives it can also be used as an entanglement resource. In a recent work [Phys. Rev. Lett. 132, 033601 (2024)], we described a protocol for the dissipative generation of two-mode squeezing in the dark state of a six-level system with only one relevant polarization. There we showed that up to two quadratures can be squeezed. Here, we develop a generalized analytic treatment to calculate the squeezing in any multilevel system where atoms can collectively decay by emitting light into two polarization modes in a cavity. We show that in this more general system up to four spin squeezed quadratures can be obtained. We study how finite-size effects constrain the reachable squeezing, and analytically compute the scaling with $N$. Our findings are readily testable in current optical cavity experiments with alkaline-earth-like atoms.

quant-ph↗

arXiv2023

Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems

We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hamiltonian in each layer. We treat gate orderings as a variational parameter and observe that doing so can provide significant performance boosts in experiments. We carried out experimental runs of a compilation-optimized implementation of fully-connected Sherrington-Kirkpatrick Hamiltonians on a 50-qubit linear-chain subsystem of Rigetti Aspen-M-3 transmon processor. Our results indicate that, for the best circuit designs tested, the average performance at optimized angles and gate orderings increases with circuit depth (using more parameters), despite the presence of a high level of noise. We report performance significantly better than using a random guess oracle for circuits involving up to approx 5000 two-qubit and approx 5000 one-qubit native gates. We additionally discuss various takeaways of our results toward more effective utilization of current and future quantum processors for optimization.

quant-ph↗

arXiv2023

Extending relax-and-round combinatorial optimization solvers with quantum correlations

We introduce a relax-and-round approach embedding the quantum approximate optimization algorithm (QAOA) with $p\geq 1$ layers. We show for many problems, including Sherrington-Kirkpatrick spin glasses, that at $p=1$, it is as accurate as its classical counterpart, and maintains the infinite-depth optimal performance guarantee of the QAOA. Employing a different rounding scheme, we prove the method shares the performance of the Goemans-Williamson algorithm for the maximum cut problem on certain graphs. We pave the way for an overarching quantum relax-and-round framework with performance on par with some of the best classical algorithms.

quant-ph↗

arXiv2023

Quantum-Enhanced Greedy Combinatorial Optimization Solver

Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challenge, and more sophisticated quantum-classical algorithms are required to bolster their performance. Here, we introduce an iterative quantum heuristic optimization algorithm to solve combinatorial optimization problems. The quantum algorithm reduces to a classical greedy algorithm in the presence of strong noise. We implement the quantum algorithm on a programmable superconducting quantum system using up to 72 qubits for solving paradigmatic Sherrington-Kirkpatrick Ising spin glass problems. We find the quantum algorithm systematically outperforms its classical greedy counterpart, signaling a quantum enhancement. Moreover, we observe an absolute performance comparable with a state-of-the-art semidefinite programming method. Classical simulations of the algorithm illustrate that a key challenge to reaching quantum advantage remains improving the quantum device characteristics.

quant-ph↗

arXiv2023

Squeezing multilevel atoms in dark states via cavity superradiance

We describe a method to create and store scalable and long-lived entangled spin-squeezed states within a manifold of many-body cavity dark states using collective emission of light from multilevel atoms inside an optical cavity. We show that the system can be tuned to generate squeezing in a dark state where it will be immune to superradiance. We also show more generically that squeezing can be generated using a combination of superradiance and coherent driving in a bright state, and subsequently be transferred via single-particle rotations to a dark state where squeezing can be stored. Our findings, readily testable in current optical cavity experiments with alkaline-earth-like atoms, can open a path for dissipative generation and storage of metrologically useful states in optical transitions.

quant-ph↗

arXiv2022

Bosonic pair production and squeezing for optical phase measurements in long-lived dipoles coupled to a cavity

We propose to simulate bosonic pair creation using large arrays of long-lived dipoles with multilevel internal structure coupled to an undriven optical cavity. Entanglement between the atoms, generated by the exchange of virtual photons through a common cavity mode, grows exponentially fast and is described by two-mode squeezing of effective bosonic quadratures. The mapping between an effective bosonic model and the natural spin description of the dipoles allows us to realize the analog of optical homodyne measurements via straightforward global rotations and population measurements of the electronic states, and we propose to exploit this for quantum-enhanced sensing of an optical phase (common and differential between two ensembles). We discuss a specific implementation based on Sr atoms and show that our sensing protocol is robust to sources of decoherence intrinsic to cavity platforms. Our proposal can open unique opportunities for next-generation optical atomic clocks.

quant-ph↗

arXiv2022

Resonant dynamics of strongly interacting SU($n$) fermionic atoms in a synthetic flux ladder

We theoretically study the dynamics of $n$-level spin-orbit coupled alkaline-earth fermionic atoms with SU($n$) symmetric interactions. We consider three dimensional lattices with tunneling along one dimension, and the internal levels treated as a synthetic dimension, realizing an $n$-leg flux ladder. Laser driving is used to couple the internal levels and to induce an effective magnetic flux through the ladder. We focus on the dense and strongly interacting regime, where in the absence of flux the system behaves as a Mott insulator with suppressed motional dynamics. At integer and fractional ratios of the laser Rabi frequency to the onsite interactions, the system exhibits resonant features in the dynamics. These resonances occur when interactions help overcome kinetic constraints upon the tunneling of atoms, thus enabling motion. Different resonances allow for the development of complex chiral current patterns. The resonances resemble the ones appearing in the longitudinal Hall resistance when the magnetic field is varied. We characterize the dynamics by studying the system's long-time relaxation behavior as a function of flux, number of internal levels $n$, and interaction strength. We observe a series of non-trivial pre-thermal plateaus caused by the emergence of resonant processes at successive orders in perturbation theory. We discuss protocols to observe the predicted phenomena under current experimental conditions.

cond-mat.quant-gas↗

arXiv2022

Multi-round QAOA and advanced mixers on a trapped-ion quantum computer

Combinatorial optimization problems on graphs have broad applications in science and engineering. The Quantum Approximate Optimization Algorithm (QAOA) is a method to solve these problems on a quantum computer by applying multiple rounds of variational circuits. However, there exist several challenges limiting the real-world applications of QAOA. In this paper, we demonstrate on a trapped-ion quantum computer that QAOA results improve with the number of rounds for multiple problems on several arbitrary graphs. We also demonstrate an advanced mixing Hamiltonian that allows sampling of all optimal solutions with predetermined weights. Our results are a step towards applying quantum algorithms to real-world problems.

quant-ph↗