activity
20192025
most citedParton distribution functions of on the lattice

54 citations · 108 across the 11 of their papers we have counts for

collaborators
Showing quant-phShow all

13 papers · 1 filter

quant-ph2025

Scalable Quantum Algorithm for Meson Scattering in a Lattice Gauge Theory

Yahui Chai, Yibin Guo, Stefan Kühn

Scattering processes are fundamental for understanding the structure of matter, yet simulating their real-time dynamics remains challenging for classical computers. Quantum computi…

quant-ph2024

Gaussian boson sampling for binary optimization

Jean Cazalis, Tirth Shah, Yahui Chai +2

Binary optimization is a fundamental area in computational science, with wide-ranging applications from logistics to cryptography, where the tasks are often formulated as Quadratic…

quant-ph2024

Quantum computing inspired paintings: reinterpreting classical masterpieces

Arianna Crippa, Yahui Chai, Omar Costa Hamido +2

We aim to apply a quantum computing technique to compose artworks. The main idea is to revisit three paintings of different styles and historical periods: ''Narciso'', painted circ…

quant-ph2024

Variational Quantum Eigensolver Approach to Prime Factorization on IBM's Noisy Intermediate Scale Quantum Computer

Mona Sobhani, Yahui Chai, Tobias Hartung +1

This paper presents a hybrid quantum-classical approach to prime factorization. The proposed algorithm is based on the Variational Quantum Eigensolver (VQE), which employs a classi…

quant-ph2024★ 2 cited

Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice

Tim Schwägerl, Yahui Chai, Tobias Hartung +2

Variational quantum algorithms and, in particular, variants of the varational quantum eigensolver have been proposed to address combinatorial optimization (CO) problems. Using only…

quant-ph2024★ 4 cited

Imaginary Hamiltonian variational ansatz for combinatorial optimization problems

Xiaoyang Wang, Yahui Chai, Xu Feng +3

Obtaining exact solutions to combinatorial optimization problems using classical computing is computationally expensive. The current tenet in the field is that quantum computers ca…

quant-ph2024★ 1 cited

Warm Start of Variational Quantum Algorithms for Quadratic Unconstrained Binary Optimization Problems

Yahui Chai, Karl Jansen, Stefan Kühn +2

Variational Quantum Eigensolver (VQE) is widely used in near-term hardware. However, their performances remain limited by the poor trainability and are dependent on random paramete…

quant-ph2023

Gaussian Boson Sampling for binary optimization

Jean Cazalis, Yahui Chai, Karl Jansen +2

In this study, we consider a Gaussian Boson Sampler for solving a Flight Gate Assignment problem. We employ a Variational Quantum Eigensolver approach using the Conditional Value-a…

quant-ph2023★ 11 cited

Fermionic wave packet scattering: a quantum computing approach

Yahui Chai, Arianna Crippa, Karl Jansen +4

Quantum computing provides a novel avenue towards simulating dynamical phenomena, and, in particular, scattering processes relevant for exploring the structure of matter. However,…

quant-ph2023

Simulating the flight gate assignment problem on a trapped ion quantum computer

Yahui Chai, Evgeny Epifanovsky, Karl Jansen +2

We study the flight gate assignment problem on IonQ's Aria trapped ion quantum computer using the variational quantum eigensolver. Utilizing the conditional value at risk as an agg…

quant-ph2023

Symmetry enhanced variational quantum imaginary time evolution

Xiaoyang Wang, Yahui Chai, Maria Demidik +3

The variational quantum imaginary time evolution (VarQITE) algorithm is a near-term method to prepare the ground state and Gibbs state of Hamiltonians. Finding an appropriate param…

quant-ph2023★ 15 cited

Towards Finding an Optimal Flight Gate Assignment on a Digital Quantum Computer

Yahui Chai, Lena Funcke, Tobias Hartung +4

We investigate the performance of the variational quantum eigensolver (VQE) for the optimal flight gate assignment problem. This problem is a combinatorial optimization problem tha…

quant-ph2021★ 21 cited

Shortcuts to Quantum Approximate Optimization Algorithm

Yahui Chai, Yong-Jian Han, Yu-Chun Wu +3

The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can ob…