Related papers: Finite Imaginary-Time Evolution for Polynomial Unc…
We present several improvements to the recently developed ground state preparation algorithm based on the Quantum Eigenvalue Transformation for Unitary Matrices (QETU), apply this algorithm to a lattice formulation of U(1) gauge theory in…
The Quadratic Unconstrained Binary Optimization (QUBO) model has gained prominence in recent years with the discovery that it unifies a rich variety of combinatorial optimization problems. By its association with the Ising problem in…
Experimental studies of synthetic quantum matter are necessarily restricted to approximate ground states prepared on finite-size quantum simulators. In general, this limits their reliability for strongly correlated systems, for instance, in…
We introduce the Constraint-Enhanced Quantum Approximate Optimization Algorithm (CE-QAOA), a shallow, constraint-aware ansatz that operates inside the one-hot product space [n]^m, where m is the number of blocks and each block is…
Achieving high-fidelity control in the presence of strong non-Markovian noise is critical for the optimization of emergent solid-state quantum devices. We present a highly efficient optimization framework that combines automatic…
In this paper, we first study the problem of combinatorial pure exploration with full-bandit feedback (CPE-BL), where a learner is given a combinatorial action space $\mathcal{X} \subseteq \{0,1\}^d$, and in each round the learner pulls an…
Imaginary Time Evolution (QITE) approximates this evolution on quantum hardware but suffers from high circuit depth and numerous measurements. In this work we introduce Adaptive-time Compressed QITE (ACQ), a novel algorithm that reduces…
This study proposes a novel method for simplifying inequality constraints in Higher-Order Binary Optimization (HOBO) formulations. The proposed method addresses challenges associated with Quadratic Unconstrained Binary Optimization (QUBO)…
For any pair of quantum states, an initial state |I> and a final quantum state |F>, in a Hilbert space, there are many Hamiltonians H under which |I> evolves into |F>. Let us impose the constraint that the difference between the largest and…
We present a hardware demonstration and resource analysis of split-evolution quantum phase estimation (SE-QPE) on a Quantinuum System Model H2 quantum computer. SE-QPE is a modification to canonical QPE for particle-conserving Hamiltonians…
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points and different series…
This paper presents key enhancements to our previous work~\cite{naghmouchi2024mixed} on a hybrid Benders decomposition (HBD) framework for solving mixed integer linear programs (MILPs). In our approach, the master problem is reformulated as…
In this work, we develop a framework aiming at designing quantum algorithms for combinatorial optimization problems while providing theoretical guarantees on their approximation ratios. The principal innovative aspect of our work is the…
We examine the recently proposed imaginary-time formulation for strongly correlated steady-state nonequilibrium for its range of validity and discuss significant improvements in the analytic continuation of the Matsubara voltage as well as…
Exact unitary transformations play a central role in the analysis and simulation of many-body quantum systems, yet the conditions under which they can be carried out exactly and efficiently remain incompletely understood. We show that exact…
Maintaining local interactions in the quantum simulation of gauge field theories relegates most states in the Hilbert space to be unphysical -- theoretically benign, but experimentally difficult to avoid. Reformulations of the gauge fields…
We present a general formalism based on the variational principle for finding the time-optimal quantum evolution of mixed states governed by a master equation, when the Hamiltonian and the Lindblad operators are subject to certain…
Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators. Yet rigorous methods for time-dependent Hamiltonians and Lindbladians remain scarce despite their wide use. We close this gap by learning the…
We present the problem of approximating the time-evolution operator $e^{-i\hat{H}t}$ to error $\epsilon$, where the Hamiltonian $\hat{H}=(\langle G|\otimes\hat{\mathcal{I}})\hat{U}(|G\rangle\otimes\hat{\mathcal{I}})$ is the projection of a…
We investigate ancilla-free linear combination of unitaries (LCU) as a framework for approximating complex quantum circuits. This is particularly effective for quantum optimization algorithms, where candidate solutions can be evaluated…