1 citations · 1 across the 5 of their papers we have counts for
6 papers
Quantum-Classical Iterative Refinement for the Pressure-Poisson Equation on NISQ Hardware
Doyeol "David" Ahn, Byeongyong Park, Rho Shin Myong +1
We present a hybrid quantum-classical iterative refinement for the pressure-Poisson equation of the incompressible Navier-Stokes projection method on noisy quantum hardware. Rather…
Code-space recovery for sample-based quantum diagonalization beyond native symmetry constraints
Byeongyong Park, Sanha Kang, Doyeol Ahn +1
Quantum algorithms that sample basis states and diagonalize a Hamiltonian in their span depend on repairing noisy measurement outcomes, using a constraint native to the target prob…
Cluster-Adaptive Sample-Based Quantum Diagonalization for Strongly Correlated Systems
Byeongyong Park, Sanha Kang, Jongseok Seo +3
Sample-based quantum diagonalization (SQD) is a hybrid quantum-classical algorithm for estimating ground-state energies in electronic-structure calculations. It uses a quantum proc…
Reducing T-Count in quantum string matching algorithm using relative-phase Fredkin gate
Byeongyong Park, Hansol Noh, Doyeol Ahn
The string-matching problem, ubiquitous in computer science, can significantly benefit from quantum algorithms due to their potential for greater efficiency compared to classical a…
Optimizing the number of CNOT gates in one-dimensional nearest-neighbor quantum Fourier transform circuit
Byeongyong Park, Doyeol Ahn
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits.…
T-count optimization of approximate quantum Fourier transform
Byeongyong Park, Doyeol Ahn
The quantum Fourier transform (QFT) is a ubiquitous quantum operation that is used in numerous quantum computing applications. The major obstacle to constructing a QFT circuit is t…