Onur Danaci

Onur Danaci

Auto-generated profile, based on publicly available information

Onur Danaci

Applied Quantum Algorithms, Lorentz Institute, Leiden University, Leiden, The Netherlands

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 May 2021 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
PDF file
ODOnur Danaci
Onur Danaci
SLSanjaya Lohani
Sanjaya Lohani
BKBrian T Kirby
Brian T Kirby
RGRyan Thomas Glasser
Ryan Thomas Glasser
Two-qubit systems typically employ 36 projective measurements for high-fidelity tomographic estimation. The overcomplete nature of the 36 measurements suggests possible robustness of the estimation procedure to missing measurements. In this paper, we explore the resilience of machine-learning-based quantum state estimation techniques to missing measurements by creating a pipeline of stacked machine learning models for imputation, denoising, and state estimation. When applied to simulated noiseless and noisy projective measurement data for both pure and mixed states, we demonstrate quantum state estimation from partial measurement results that outperforms previously developed machine-learning-based methods in reconstruction fidelity and several conventional methods in terms of resource scaling. Notably, our developed model does not require training a separate model for each missing measurement, making it potentially applicable to quantum state estimation of large quantum systems where preprocessing is computationally infeasible due to the exponential scaling of quantum system dimension.

1 January 2024 in New Journal of Physics
Verified
Journal Article
Open access
Akash KunduAkash Kundu
Akash Kundu
PBPrzemysław Bedełek
Przemysław Bedełek
MOMateusz Ostaszewski
Mateusz Ostaszewski
ODOnur Danaci
Onur Danaci
YPYash J Patel
Yash J Patel
Jaroslaw MiszczakJaroslaw Miszczak
Jaroslaw Miszczak
The variational quantum algorithms are crucial for the application of NISQ computers. Such algorithms require short quantum circuits, which are more amenable to implementation on near-term hardware, and many such methods have been developed. One of particular interest is the so-called variational quantum state diagonalization method, which constitutes an important algorithmic subroutine and can be used directly to work with data encoded in quantum states. In particular, it can be applied to discern the features of quantum states, such as entanglement properties of a system, or in quantum machine learning algorithms. In this work, we tackle the problem of designing a very shallow quantum circuit, required in the quantum state diagonalization task, by utilizing reinforcement learning (RL). We use a novel encoding method for the RL-state, a dense reward function, and an ε-greedy policy to achieve this. We demonstrate that the circuits proposed by the RL methods are shallower than the standard variational quantum state diagonalization algorithm and thus can be used in situations where hardware capabilities limit the depth of quantum circuits. The methods we propose in the paper can be readily adapted to address a wide range of variational quantum algorithms.

9 August 2023 in AVS Quantum Science
Verified
Journal Article
Open access
PDF file
ODOnur Danaci
Onur Danaci
WZWenlei Zhang
Wenlei Zhang
RCRobert Coleman
Robert Coleman
WDWilliam Djakam
William Djakam
MAMichaela Amoo
Michaela Amoo
TSThomas A. Searles
Thomas A. Searles
The ability to prepare systems in specific target states through quantum engineering is essential for realizing the new technologies promised by a second quantum revolution. Here, we recast the fundamental problem of state preparation in high-dimensional Hilbert spaces as ManQala, a quantum game inspired by the West African sowing game mancala. Motivated by optimal gameplay in solitaire mancala, where nested nearest-neighbor permutations and actions evolve the state of the game board to its target configuration, ManQala acts as a pre-processing approach for deterministically arranging particles in a quantum control problem. Once pre-processing with ManQala is complete, existing quantum control methods are applied, but now with a reduced search space. We find that ManQala-type strategies match, or outperform, competing approaches in terms of final state variance even in small-scale quantum state engineering problems where we expect the slightest advantage, since the relative reduction in search space is the least. These results suggest that ManQala provides a rich platform for designing control protocols relevant to quantum technologies.

1 January 2020
Verified
Conference Paper
Closed access
PDF file
ODOnur Danaci
Onur Danaci
SLSanjaya Lohani
Sanjaya Lohani
BKBrian T Kirby
Brian T Kirby
MBMichael Brodsky
Michael Brodsky
RGRyan T Glasser
Ryan T Glasser
Reconstruction of two-qubit systems typically performed using 36 coincidence measurements. We trained an ensemble of CNN & XGBoost ML models, employed imputation to demonstrate high-fidelity state estimation when multiple measurements are missing.