SearcharxivSearch

arXiv subjects

Dongkeun Lee

Publications and source records attributed to Dongkeun Lee.

8 recordsLinked to original sources

Locally Acting Grover Mixers for Constraint-Preserving QAOA

The Grover mixer quantum alternating operator ansatz (GM-QAOA) employs the Grover mixer to confine the quantum evolution to the feasible subspace defined by the problem. Its mixing unitary, however, requires a global multi-controlled phase-shift gate acting on all qubits, resulting in substantial circuit overhead on near-term quantum devices. In this work, we propose locally acting Grover mixers tailored to initial states that admit a product structure over disjoint qubit subsystems, which may be obtained by encoding only a subset of problem constraints into the initial state preparation. The proposed method preserves the search space defined by the initial state while significantly lowering implementation cost, as the global multi-controlled phase-shift gate is replaced with local operations on disjoint subsystems. Numerical simulations on the exact-cover problem and the traveling salesman problem (TSP) demonstrate that the proposed method achieves convergence behavior comparable to that of the original GM-QAOA, while using shallower circuits with fewer gates. We further compare two constraint encoding strategies for the TSP, encoding only a subset of constraints versus all constraints into the initial state preparation, and show that the former combined with the proposed mixer yields markedly more compact circuits at the point where comparable solution quality is achieved.

quant-ph

Subspace Variational Quantum Simulation: Fidelity Lower Bounds as Measures of Training Success

We propose an iterative variational quantum algorithm to simulate the time evolution of arbitrary initial states within a given subspace. The algorithm compresses the Trotter circuit into a shorter-depth parameterized circuit, which is optimized simultaneously over multiple initial states in a single training process using fidelity-based cost functions. After the whole training procedure, we provide an efficiently computable lower bound on the fidelities for arbitrary states within the subspace, which guarantees the performance of the algorithm in the worst-case training scenario. We also show our cost function exhibits a barren-plateau-free region near the initial parameters at each iteration in the training landscape. The experimental demonstration of the algorithm is presented through the simulation of a 2-qubit Ising model on an IBMQ processor. As a demonstration for a larger system, a simulation of a 10-qubit Ising model is also provided.

quant-ph

Quantum Amplitude-Amplification Eigensolver: A State-Learning-Assisted Approach beyond Energy-Gradient-Based Heuristics

Ground-state estimation lies at the heart of a broad range of quantum simulations. Most near-term approaches are cast as variational energy minimization and thus inherit the challenges of problem-specific energy landscapes. We develop the quantum amplitude-amplification eigensolver (QAAE), which departs from the variational paradigm and instead coherently drives a trial state toward the ground state via quantum amplitude amplification. Each amplitude-amplification round interleaves a reflection about the learned trial state with a controlled short-time evolution under a normalized Hamiltonian; an ancilla readout yields an amplitude-amplified pure target state that a state-learning step then re-encodes into an ansatz circuit for the next round -- without evaluating the energy gradients. Under standard assumptions (normalized $\hat{H}$, a nondegenerate ground-state, and a learning update), the ground-state overlap increases monotonically per round and the procedure converges; here, a per-round depth bound in terms of the ansatz depth and Hamiltonian-simulation cost establishes hardware compatibility. Cloud experiments on IBMQ processor verify our amplification mechanism on a two-level Hamiltonian and a two-qubit Ising model, and numerical benchmarks on $\mathrm{H}_2$, $\mathrm{LiH}$, and a $10$-qubit longitudinal-and-transverse-field Ising model show that QAAE integrates with chemistry-inspired and hardware-efficient circuits and can surpass gradient-based VQE in accuracy and stability. These results position QAAE as a variational-free and hardware-compatible route to ground-state estimation for near-term quantum simulation.

quant-ph

A variational quantum eigensolver tailored to multi-band tight-binding simulations of electronic structures

We propose a cost-efficient measurement scheme of the variational quantum eigensolver (VQE) for atomistic simulations of electronic structures based on a tight-binding (TB) theory. Leveraging the lattice geometry of a material domain, the sparse TB Hamiltonian is constructed in a bottom-up manner and is represented as a linear combination of the standard-basis (SB) operators. The cost function is evaluated with an extended version of the Bell measurement circuit that can simultaneously measure multiple SB operators and therefore reduces the number of circuits required bythe evaluation process. The proposed VQE scheme is applied to find band-gap energies of metal-halide-perovskite supercells that have finite dimensions with closed boundaries and are described with a sp3 TB model. Experimental results confirm that the proposed scheme gives solutions that follow well the accurate ones, but, more importantly, has the computing efficiency that is obviously superior to the commutativity-based Pauli grouping methods. Extending the application scope of VQE to three-dimensional confined atomic structures, this work can serve as a practical guideline for handling TB simulations in the noise-intermediate-scale quantum devices.

quant-ph

Sampling Error Analysis in Quantum Krylov Subspace Diagonalization

Quantum Krylov subspace diagonalization (QKSD) is an emerging method used in place of quantum phase estimation in the early fault-tolerant era, where limited quantum circuit depth is available. In contrast to the classical Krylov subspace diagonalization (KSD) or the Lanczos method, QKSD exploits the quantum computer to efficiently estimate the eigenvalues of large-size Hamiltonians through a faster Krylov projection. However, unlike classical KSD, which is solely concerned with machine precision, QKSD is inherently accompanied by errors originating from a finite number of samples. Moreover, due to difficulty establishing an artificial orthogonal basis, ill-conditioning problems are often encountered, rendering the solution vulnerable to noise. In this work, we present a nonasymptotic theoretical framework to assess the relationship between sampling noise and its effects on eigenvalues. We also propose an optimal solution to cope with large condition numbers by eliminating the ill-conditioned bases. Numerical simulations of the one-dimensional Hubbard model demonstrate that the error bound of finite samplings accurately predicts the experimental errors in well-conditioned regions.

quant-ph

Detection of quantum phase transition in spin-1 chain through multipartite high-order correlations

We design a Bell inequality that is violated by correlations obtained from the ground states of XXZ spin-1 chain with on site anisotropies at the region of phase transition. In order to detect such correlations in spin-1 systems we exploit the formalism of generalized Bell inequality via the use of multipartite and high order correlations. We observe sharp violation in the vicinity of quantum phase transition between the so called large D and AFM phase. Interestingly, the violation of our Bell inequality is manifested by the change of the XXZ spin-1 chain ground state to a Greenberger-Horne-Zeilinger (GHZ)-like state at the critical region. Our results provide the first characterization of quantum phase transition via the violation of Bell-type constraint by correlations in the XXZ spin-1 chain with multi-body correlations and high-order measurements.

quant-ph

Variational quantum state discriminator for supervised machine learning

Quantum state discrimination (QSD) is a fundamental task in quantum information processing with numerous applications. We present a variational quantum algorithm that performs the minimum-error QSD, called the variational quantum state discriminator (VQSD). The VQSD uses a parameterized quantum circuit that is trained by minimizing a cost function derived from the QSD, and finds the optimal positive-operator valued measure (POVM) for distinguishing target quantum states. The VQSD is capable of discriminating even unknown states, eliminating the need for expensive quantum state tomography. Our numerical simulations and comparisons with semidefinite programming demonstrate the effectiveness of the VQSD in finding optimal POVMs for minimum-error QSD of both pure and mixed states. In addition, the VQSD can be utilized as a supervised machine learning algorithm for multi-class classification. The area under the receiver operating characteristic curve obtained in numerical simulations with the Iris flower dataset ranges from 0.97 to 1 with an average of 0.985, demonstrating excellent performance of the VQSD classifier.

quant-ph

Bell-type correlation at quantum phase transitions in spin-1 chain

For the identification of non-trivial quantum phase, we exploit a Bell-type correlation that is applied to the one-dimensional spin-1 XXZ chain. It is found that our generalization of bipartite Bell correlation can take a decomposed form of transverse spin correlation together with high-order terms. The formulation of density-matrix renormalisation group is utilized to obtain the ground state of a given Hamiltonian with non-trivial phase. Subsequently Bell-SLK-type generalized correlation is evaluated through the analysis of the matrix product state. Diverse classes of quantum phase transitions in the spin-1 model are identified precisely through the evaluation of the first and the second moments of the generalized Bell correlations. The role of high-order terms in the criticality has been identified and their physical implications for the quantum phase has been revealed.

quant-ph