Daniel Koch

Dr. Daniel Koch


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 September 2020 in AIP Advances
Verified
Journal Article
Open access
PDF file
DKDaniel Koch
Daniel Koch
BMBrett Martin
Brett Martin
SPSaahil Patel
Saahil Patel
LWLaura Wessing
Laura Wessing
PAPaul M. Alsing
Paul M. Alsing
As superconducting qubits continue to advance technologically, the realization of quantum algorithms from theoretical abstraction to physical implementation requires knowledge of both quantum circuit construction as well as hardware limitations. In this study, we present results from experiments run on IBM’s 20-qubit “Poughkeepsie” architecture, with the goal of demonstrating various qubit qualities and challenges that arise in designing quantum algorithms. These include experimentally measuring T1 and T2 coherence times, gate fidelities, sequential CNOT gates, techniques for handling ancilla qubits, and finally CCNOT and QFT† circuits implemented on several different qubit geometries. Our results demonstrate various techniques for improving quantum circuits, which must compensate for limited connectivity, either through the use of SWAP gates or additional ancilla qubits.

19 May 2015 in Journal of Physics A: Mathematical and Theoretical
Verified
Journal Article
Closed access
Ken WhartonKen Wharton
Ken Wharton
DKDaniel Koch
Daniel Koch
The spinor representation of spin-1/2 states can equally well be mapped to a single unit quaternion, yielding a new perspective despite the equivalent mathematics. This paper first demonstrates a useable map that allows Bloch-sphere rotations to be represented as quaternionic multiplications, simplifying the form of the dynamical equations. Left-multiplications generally correspond to non-unitary transformations, providing a simpler (essentially classical) analysis of time-reversal. But the quaternion viewpoint also reveals a surprisingly large broken symmetry, as well as a potential way to restore it, via a natural expansion of the state space that has parallels to second order fermions. This expansion to ‘second order qubits’ would imply either a larger gauge freedom or a natural space of hidden variables.

12 January 2018 in Physical Review A
Verified
Journal Article
Closed access
PDF file
DKDaniel Koch
Daniel Koch
MHMark Hillery
Mark Hillery
We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a “tree maze,” we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.

11 July 2022 in Entropy
Verified
Journal Article
Open access
PDF file
DKDaniel Koch
Daniel Koch
MCMassimiliano Cutugno
Massimiliano Cutugno
SKSamuel Karlson
Samuel Karlson
SPSaahil Patel
Saahil Patel
LWLaura Wessing
Laura Wessing
Paul M AlsingPaul M Alsing
Paul M Alsing
We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding the minimum or maximum solutions on a weighted directed graph. We focus on the geometry of sequentially connected bipartite graphs, which naturally gives rise to solution spaces describable by Gaussian distributions. We then demonstrate how an oracle that encodes these distributions can be used to solve for the optimal path via amplitude amplification. And finally, we explore the degree to which this algorithm is capable of solving cases that are generated using randomized weights, as well as a theoretical application for solving the Traveling Salesman problem.

27 April 2023 in AVS Quantum Science
Verified
Journal Article
Open access
PDF file
BCBenjamin Collis
Benjamin Collis
SPSaahil Patel
Saahil Patel
DKDaniel Koch
Daniel Koch
MCMassimiliano Cutugno
Massimiliano Cutugno
LWLaura Wessing
Laura Wessing
Paul M AlsingPaul M Alsing
Paul M Alsing
We develop and implement two realizations of quantum graph neural networks (QGNN), applied to the task of particle interaction simulation. The first QGNN is a speculative quantum-classical hybrid learning model that relies on the ability to directly utilize superposition states as classical information to propagate information between particles. The second is an implementable quantum-classical hybrid learning model that propagates particle information directly through the parameters of RX rotation gates. A classical graph neural network (CGNN) is also trained in the same task. Both the Speculative QGNN and CGNN act as controls against the Implementable QGNN. Comparison between classical and quantum models is based on the loss value and accuracy of each model. Overall, each model had a high learning efficiency, in which the loss value rapidly approached zero during training; however, each model was moderately inaccurate. Comparing performances, our results show that the Implementable QGNN has a potential advantage over the CGNN. Additionally, we show that a slight alteration in hyperparameters in the CGNN notably improves accuracy, suggesting that further fine tuning could mitigate the issue of moderate inaccuracy in each model.

23 March 2023 in Physica Scripta
Verified
Journal Article
Open access
PDF file
SPSaahil Patel
Saahil Patel
BCBenjamin Collis
Benjamin Collis
WDWilliam Duong
William Duong
DKDaniel Koch
Daniel Koch
MCMassimiliano Cutugno
Massimiliano Cutugno
PAPaul Alsing
Paul Alsing
We examine information loss, resource costs, and run time from practical application of quantum data compression. Compressing quantum data to fewer qubits enables efficient use of resources, as well as applications for quantum communication and denoising. In this context, we provide a description of the quantum and classical components of the hybrid quantum autoencoder algorithm, implemented using IBMs Qiskit language. Utilizing our own data sets, we encode bitmap images as quantum superposition states, which correspond to linearly independent vectors with density matrices of discrete values. We successfully compress this data with near-lossless compression using simulation, and then run our algorithm on an IBMQ quantum chip. We describe conditions and run times for training and compressing our data on quantum devices, and relate trainability to specific characteristics and performance metrics of our parametric quantum circuits.