arXiv subjects

Kübra Yeter-Aydeniz

Publications and source records attributed to Kübra Yeter-Aydeniz.

15 recordsLinked to original sources

arXiv2026

Towards Studying Superconductivity in the Fermi-Hubbard Model on Rydberg Atoms

We present a method for calculating the ground state energy of the Fermi-Hubbard model leveraging Rydberg atom processors and sample-based quantum diagonalization (SQD). By exploiting the perturbative relationship between the Fermi-Hubbard and Heisenberg models, the procedure samples from the Heisenberg model as prepared on the Rydberg atom processor, and uses the samples to diagonalize the Fermi-Hubbard model for large U. We include anisotropy and next-nearest-neighbor interactions and discuss the relevant regime for quasi-superconductivity in the 1-dimensional Fermi- Hubbard model. Numerical and experimental results on the Aquila quantum processor are presented for ground state energy calculations as well as the chemical potential. We find that the Heisenberg model sampling in the studied regime is sufficient to converge near to the ground state for up to 56 qubits, and we see a clear advantage of Rydberg atom sampling as opposed to random sampling even with 10x more samples for diagonalization. We also present a gate-based implementation of the gate-based SQD algorithm on IBM Quantum hardware for 56-qubit Hubbard model as a benchmark. Finally, we provide a gap analysis for studying emergent superconductivity using this method.

quant-ph↗

arXiv2025

Hybrid Quantum-Classical Latent Diffusion Models for Medical Image Generation

Generative learning models in medical research are crucial in developing training data for deep learning models and advancing diagnostic tools, but the problem of high-quality, diverse images is an open topic of research. Quantum-enhanced generative models have been proposed and tested in the literature but have been restricted to small problems below the scale of industry relevance. In this paper, we propose quantum-enhanced diffusion and variational autoencoder (VAE) models and test them on the fundus retinal image generation task. In our numerical experiments, the images generated using quantum-enhanced models are of higher quality, with 86% classified as gradable by external validation compared to 69% with the classical model, and they match more closely in features to the real image distribution compared to the ones generated using classical diffusion models, even when the classical diffusion models are larger than the quantum model. Additionally, we perform noisy testing to confirm the numerical experiments, finding that quantum-enhanced diffusion model can sometimes produce higher quality images, both in terms of diversity and fidelity, when tested with quantum hardware noise. Our results indicate that quantum diffusion models on current quantum hardware are strong targets for further research on quantum utility in generative modeling for industrially relevant problems.

quant-ph↗

arXiv2025

Variational Quantum Annealing for Quantum Chemistry

We introduce a variational quantum annealing (VarQA) algorithm for electronic structure theory, in which we use the quantum annealer as a sampler and prepare an ansatz state through its statistics. We also introduce a strategy called the "digitizer" for searching the space of variational parameters efficiently. We demonstrate the effectiveness of VarQA by evaluating the ground-state potential energy surface for molecules with up to $20$ spin orbitals as well as an excited-state potential energy surface. This approach resembles the workings of the quantum Boltzmann Machines (QBMs), but is generalized to handle distributions beyond the Boltzmann distribution. In VarQA, with the number of required logical qubits equal to the number of spin orbitals, a fully connected Ising Hamiltonian can be readily implemented in a large-scale quantum annealer as a scalable ansatz for electronic structure calculations.

quant-ph↗

arXiv2025

Efficient Quantum Chemistry Calculations on Noisy Quantum Hardware

We present a hardware-efficient optimization scheme for quantum chemistry calculations, utilizing the Sampled Quantum Diagonalization (SQD) method. Our algorithm, optimized SQD (SQDOpt), combines the classical Davidson method technique with added multi-basis measurements to optimize a quantum Ansatz on hardware using a fixed number of measurements per optimization step. This addresses the key challenge associated with other quantum chemistry optimization protocols, namely Variational Quantum Eigensolver (VQE), which must measure in hundreds to thousands of bases to estimate energy on hardware, even for molecules with less than 20 qubits. Numerical results for various molecules, including hydrogen chains, water, and methane, demonstrate the efficacy of our method compared to classical and quantum variational approaches, and we confirm the performance on the IBM-Cleveland quantum hardware, where we find instances where SQDOpt either matches or exceeds the solution quality of noiseless VQE. A runtime scaling indicates that SQDOpt on quantum hardware is competitive with classical state-of-the-art methods, with a crossover point of 1.5 seconds/iteration for the SQDOpt on quantum hardware and classically simulated VQE with the 20-qubit H$_{12}$ molecule. Our findings suggest that the proposed SQDOpt framework offers a scalable and robust pathway for quantum chemistry simulations on noisy intermediate-scale quantum (NISQ) devices.

quant-ph↗

arXiv2024

Continuous-variable Quantum Boltzmann Machine

We propose a continuous-variable quantum Boltzmann machine (CVQBM) using a powerful energy-based neural network. It can be realized experimentally on a continuous-variable (CV) photonic quantum computer. We used a CV quantum imaginary time evolution (QITE) algorithm to prepare the essential thermal state and then designed the CVQBM to proficiently generate continuous probability distributions. We applied our method to both classical and quantum data. Using real-world classical data, such as synthetic aperture radar (SAR) images, we generated probability distributions. For quantum data, we used the output of CV quantum circuits. We obtained high fidelity and low Kuller-Leibler (KL) divergence showing that our CVQBM learns distributions from given data well and generates data sampling from that distribution efficiently. We also discussed the experimental feasibility of our proposed CVQBM. Our method can be applied to a wide range of real-world problems by choosing an appropriate target distribution (corresponding to, e.g., SAR images, medical images, and risk management in finance). Moreover, our CVQBM is versatile and could be programmed to perform tasks beyond generation, such as anomaly detection.

quant-ph↗

arXiv2024

Solving Power Grid Optimization Problems with Rydberg Atoms

The rapid development of neutral atom quantum hardware provides a unique opportunity to design hardware-centered algorithms for solving real-world problems aimed at establishing quantum utility. In this work, we study the performance of two such algorithms on solving MaxCut problem for various weighted graphs. The first method uses a state-of-the-art machine learning tool to optimize the pulse shape and embedding of the graph using an adiabatic Ansatz to find the ground state. We tested the performance of this method on finding maximum power section task of the IEEE 9-bus power system and obtaining MaxCut of randomly generated problems of size up to 12 on the Aquila quantum processor. To the best of our knowledge, this work presents the first MaxCut results on Quera's Aquila quantum hardware. Our experiments run on Aquila demonstrate that even though the probability of obtaining the solution is reduced, one can still solve the MaxCut problem on cloud-accessed neutral atom quantum hardware. The second method uses local detuning, which is an emergent update on the Aquila hardware, to obtain a near exact realization of the standard QAOA Ansatz with similar performance. Finally, we study the fidelity throughout the time evolution realized in the adiabatic method as a benchmark for the IEEE 9-bus power grid graph state.

quant-ph↗

arXiv2023

Quantum computation of dynamical quantum phase transitions and entanglement tomography in a lattice gauge theory

Strongly-coupled gauge theories far from equilibrium may exhibit unique features that could illuminate the physics of the early universe and of hadron and ion colliders. Studying real-time phenomena has proven challenging with classical-simulation methods, but is a natural application of quantum simulation. To demonstrate this prospect, we quantum compute non-equal time correlation functions and perform entanglement tomography of non-equilibrium states of a simple lattice gauge theory, the Schwinger model, using a trapped-ion quantum computer by IonQ Inc. As an ideal target for near-term devices, a recently-predicted [Zache et al., Phys. Rev. Lett. 122, 050403 (2019)] dynamical quantum phase transition in this model is studied by preparing, quenching, and tracking the subsequent non-equilibrium dynamics in three ways: i) overlap echos signaling dynamical transitions, ii) non-equal time correlation functions with an underlying topological nature, and iii) the entanglement structure of non-equilibrium states, including entanglement Hamiltonians. These results constitute the first observation of a dynamical quantum phase transition in a lattice gauge theory on a quantum computer, and are a first step toward investigating topological phenomena in nuclear and high-energy physics using quantum technologies.

quant-ph↗

arXiv2022

An entanglement-based volumetric benchmark for near-term quantum hardware

We introduce a volumetric benchmark for near-term quantum platforms based on the generation and verification of genuine entanglement across n-qubits using graph states and direct stabilizer measurements. Our benchmark evaluates the robustness of multipartite and bipartite n-qubit entanglement with respect to many sources of hardware noise: qubit decoherence, CNOT and swap gate noise, and readout error. We demonstrate our benchmark on multiple superconducting qubit platforms available from IBM (ibmq_belem, ibmq_toronto, ibmq_guadalupe and ibmq_jakarta). Subsets of $n<10$ qubits are used for graph state preparation and stabilizer measurement. Evaluation of genuine and biseparable entanglement witnesses we report observations of $5$ qubit genuine entanglement, but robust multipartite entanglement is difficult to generate for $n>4$ qubits and identify two-qubit gate noise as strongly correlated with the quality of genuine multipartite entanglement.

quant-ph↗

arXiv2022

Quantum Simulation for High Energy Physics

It is for the first time that Quantum Simulation for High Energy Physics (HEP) is studied in the U.S. decadal particle-physics community planning, and in fact until recently, this was not considered a mainstream topic in the community. This fact speaks of a remarkable rate of growth of this subfield over the past few years, stimulated by the impressive advancements in Quantum Information Sciences (QIS) and associated technologies over the past decade, and the significant investment in this area by the government and private sectors in the U.S. and other countries. High-energy physicists have quickly identified problems of importance to our understanding of nature at the most fundamental level, from tiniest distances to cosmological extents, that are intractable with classical computers but may benefit from quantum advantage. They have initiated, and continue to carry out, a vigorous program in theory, algorithm, and hardware co-design for simulations of relevance to the HEP mission. This community whitepaper is an attempt to bring this exciting and yet challenging area of research to the spotlight, and to elaborate on what the promises, requirements, challenges, and potential solutions are over the next decade and beyond.

quant-ph↗

arXiv2021

Quantum Imaginary Time Evolution Algorithm for Quantum Field Theories with Continuous Variables

We calculate the energy levels and corresponding eigenstates of an interacting scalar quantum field theory on a lattice using a continuous-variable version of the quantum imaginary time evolution algorithm. Only a single qumode is needed for the simulation of the field at each point on the lattice. Our quantum algorithm avoids the use of non-Gaussian quantum gates and relies, instead, on detectors projecting onto eigenstates of the photon-number operator. Using Xanadu's Strawberry Fields simulator, we obtain results on energy levels that are in very good agreement with results from exact calculations. We propose an experimental setup that can be realized with existing technology.

quant-ph↗

arXiv2021

Collective Neutrino Oscillations on a Quantum Computer

We calculate the energy levels of a system of neutrinos undergoing collective oscillations as functions of an effective coupling strength and radial distance from the neutrino source using the quantum Lanczos (QLanczos) algorithm implemented on IBM Q quantum computer hardware. Our calculations are based on the many-body neutrino interaction Hamiltonian introduced in Ref.\ \cite{Patwardhan2019}. We show that the system Hamiltonian can be separated into smaller blocks, which can be represented using fewer qubits than those needed to represent the entire system as one unit, thus reducing the noise in the implementation on quantum hardware. We also calculate transition probabilities of collective neutrino oscillations using a Trotterization method which is simplified before subsequent implementation on hardware. These calculations demonstrate that energy eigenvalues of a collective neutrino system and collective neutrino oscillations can both be computed on quantum hardware with certain simplification to within good agreement with exact results.

quant-ph↗

arXiv2021

Scattering in the Ising Model Using Quantum Lanczos Algorithm

Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites with periodic boundary conditions on a quantum computer. We use the quantum Lanczos algorithm to obtain all energy levels and corresponding eigenstates of the system. We simplify the quantum computation by taking advantage of the symmetries of the system. These results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time. The quantum circuits were executed on IBM 5-qubit superconducting hardware. The experimental results with readout error mitigation are in very good agreement with the values obtained using exact diagonalization.

quant-ph↗

arXiv2021

Benchmarking Quantum Chemistry Computations with Variational, Imaginary Time Evolution, and Krylov Space Solver Algorithms

The rapid progress of noisy intermediate-scale quantum (NISQ) computing underscores the need to test and evaluate new devices and applications. Quantum chemistry is a key application area for these devices, and therefore serves as an important benchmark for current and future quantum computer performance. Previous benchmarks in this field have focused on variational methods for computing ground and excited states of various molecules, including a benchmarking suite focused on performance of computing ground states for alkali-hydrides under an array of error mitigation methods. Here, we outline state of the art methods to reach chemical accuracy in hybrid quantum-classical electronic structure calculations of alkali hydride molecules on NISQ devices from IBM. We demonstrate how to extend the reach of variational eigensolvers with new symmetry preserving Ansätze. Next, we outline how to use quantum imaginary time evolution and Lanczos as a complementary method to variational techniques, highlighting the advantages of each approach. Finally, we demonstrate a new error mitigation method which uses systematic error cancellation via hidden inverse gate constructions, improving the performance of typical variational algorithms. These results show that electronic structure calculations have advanced rapidly, to routine chemical accuracy for simple molecules, from their inception on quantum computers a few short years ago, and they point to further rapid progress to larger molecules as the power of NISQ devices grows.

quant-ph↗

arXiv2019

Practical Quantum Computation of Chemical and Nuclear Energy Levels Using Quantum Imaginary Time Evolution and Lanczos Algorithms

Various methods have been developed for the quantum computation of the ground and excited states of physical and chemical systems, but many of them require either large numbers of ancilla qubits or high-dimensional optimization. The quantum imaginary-time evolution (QITE) and quantum Lanczos (QLanczos) methods proposed in [1] eschew the aforementioned issues. In this study, we demonstrate the practical application of these algorithms to nontrivial quantum computation, using the deuteron binding energy and molecular Hydrogen binding and excited state energies as examples. With the correct choice of initial and final states, we show that the number of time steps in QITE and QLanczos can be reduced significantly, which commensurately simplifies the required quantum circuit and improves compatibility with NISQ devices. We have performed these calculations on cloud-accessible IBM-Q quantum computers. With the application of readout-error mitigation and Richardson error extrapolation, we have obtained ground and excited state energies that agree well with exact results obtained from diagonalization.

quant-ph↗

arXiv2018

Quantum Computation of Scattering Amplitudes in Scalar Quantum Electrodynamics

We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in expo- nential speedup over classical methods. We derive a simple form of the Hamiltonian including interactions, and a straightforward implementation of the constraint due to gauge invariance.

quant-ph↗