10 papers
Grover's algorithm is an approximation of imaginary-time evolution
Yudai Suzuki, Marek Gluza, Jeongrak Son +3
We reveal the power of Grover's algorithm from thermodynamic and geometric perspectives by showing that it is a product formula approximation of imaginary-time evolution (ITE), a R…
Double-bracket algorithm for quantum signal processing without post-selection
Yudai Suzuki, Bi Hong Tiang, Jeongrak Son +3
Quantum signal processing (QSP), a framework for implementing matrix-valued polynomials, is a fundamental primitive in various quantum algorithms. Despite its versatility, a potent…
Double-bracket quantum algorithms for high-fidelity ground state preparation
Matteo Robbiati, Edoardo Pedicillo, Andrea Pasquale +13
Ground state preparation is a central application for quantum computers but remains challenging in practice. In this work, we quantitatively investigate the performance and gate co…
Double-Bracket Algorithmic Cooling
Mohammed Alghadeer, Khanh Uyen Giang, Shuxiang Cao +6
Algorithmic cooling shows that it is possible to locally reduce the entropy of a qubit belonging to an isolated ensemble such as nuclear spins in molecules or nitrogen-vacancy cent…
Extensive entanglement between coupled Tomonaga-Luttinger liquids in and out of equilibrium
Taufiq Murtadho, Marek Gluza, Nelly H. Y. Ng
Quantum entanglement exists in nature but is absent in classical physics, hence it fundamentally distinguishes quantum from classical theories. While entanglement is routinely obse…
Double-bracket quantum algorithms for quantum imaginary-time evolution
Marek Gluza, Jeongrak Son, Bi Hong Tiang +5
Efficiently preparing approximate ground-states of large, strongly correlated systems on quantum hardware is challenging and yet nature is innately adept at this. This has motivate…