Davide Vodola

Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling

Archismita Dalal [1], Iraitz Montalban [1], Narendra N. Hegade [1], Alejandro Gomez Cadavid [1,2], Enrique Solano [1], Abhishek Awasthi [3], Davide Vodola [3], Caitlin Jones [3], Horst Weiss [4,1], Gernot Füchsel

Abstract

We study a job shop scheduling problem for an automatized robot in a high-throughput laboratory and a travelling salesperson problem with recently proposed digitized counterdiabatic quantum optimization (DCQO)algorithms. In DCQO, we find the solution of an optimization problem via an adiabatic quantum dynamics, which is accelerated with counterdiabatic protocols. Thereafter, we digitize the global unitary to encode it in a digital quantum computer. For the job-shop scheduling problem, we aim at finding the optimal schedule for a robot executing a number of tasks under specific constraints, such that the total execution time of the process is minimized. For the traveling salesperson problem, the goal is to find the path that covers all cities and is associated with the shortest traveling distance. We consider both hybrid and pure versions of DCQO algorithms and benchmark the performance against digitized quantum annealing and the quantum approximate optimization algorithm (QAOA). In comparison to QAOA, the DCQO solution is improved by several orders of magnitude in success probability using the same number of two-qubit gates. Moreover, we implement our algorithms on cloud-based superconducting and trapped-ion quantum processors. Our results demonstrate that circuit compression using counterdiabatic protocols is amenable to current NISQ hardware and can solve logistics scheduling problems, where other digital quantum algorithms show insufficient performance.

Ion-Based Quantum Computing Hardware: Performance and End-User Perspective

Thomas Strohm [1], Karen Wintersperger, Florian Dommert, Daniel Basilewitsch, Georg Reuber, Andrey Hoursanov, Thomas Ehmer, Davide Vodola, Sebastian Luber

Abstract

This is the second paper in a series of papers providing an overview of different quantum computing hardware platforms from an industrial end-user perspective. It follows our first paper on neutral-atom quantum computing. In the present paper, we provide a survey on the current state-of-the-art in trapped-ion quantum computing, taking up again the perspective of an industrial end-user. To this end, our paper covers, on the one hand, a comprehensive introduction to the physical foundations and mechanisms that play an important role in operating a trapped-ion quantum computer. On the other hand, we provide an overview of the key performance metrics that best describe and characterise such a device's current computing capability. These metrics encompass performance indicators such as qubit numbers, gate times and errors, native gate sets, qubit stability and scalability as well as considerations regarding the general qubit types and trap architectures. In order to ensure that these metrics reflect the current state of trapped-ion quantum computing as accurate as possible, they have been obtained by both an extensive review of recent literature and, more importantly, from discussions with various quantum hardware vendors in the field. We combine these factors and provide - again from an industrial end-user perspective - an overview of what is currently possible with trapped-ion quantum computers, which algorithms and problems are especially suitable for this platform, what are the relevant end-to-end wall clock times for calculations, and what might be possible with future fault-tolerant trapped-ion quantum computers.

Analytical and experimental study of center line miscalibrations in Mølmer-Sørensen gates

Fernando Martínez-García, Lukas Gerster [2], Davide Vodola [3,4], Pavel Hrmo [2], Thomas Monz [2,5], Philipp Schindler [2,6,7], Markus Müller

Abstract

A major challenge for the realisation of useful universal quantum computers is achieving high fidelity two-qubit entangling gate operations. However, calibration errors can affect the quantum gate operations and limit their fidelity. To reduce such errors it is desirable to have an analytical understanding and quantitative predictions of the effects that miscalibrations of gate parameters have on the gate performance. In this work, we study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate, which is widely used in trapped ion quantum processors. Our analytical treatment particularly focuses on systematic center line detuning miscalibrations. Via a unitary Magnus expansion, we compute the gate evolution operator which allows us to obtain relevant key properties such as relative phases, electronic populations, quantum state purity and fidelities. These quantities, subsequently, are used to assess the performance of the gate using the fidelity of entangled states as performance metric. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor. The method and the results presented here can help design and calibrate high-fidelity gate operations of large-scale quantum computers.

Experimental Bayesian calibration of trapped ion entangling operations

Lukas Gerster [1,2], Fernando Martínez-García, Pavel Hrmo [1], Martin van Mourik [1], Benjamin Wilhelm [1], Davide Vodola [3,4,5], Markus Müller, Rainer Blatt [1,6], Philipp Schindler [1], Thomas Monz [1,7]

Abstract

The performance of quantum gate operations is experimentally determined by how correct operational parameters can be determined and set, and how stable these parameters can be maintained. In addition, gates acting on different sets of qubits require unique sets of control parameters. Thus, an efficient multi-dimensional parameter estimation procedure is crucial to calibrate even medium sized quantum processors. Here, we develop and characterize an efficient calibration protocol to automatically estimate and adjust experimental parameters of the widely used Molmer-Sorensen entangling gate operation in a trapped ion quantum information processor. The protocol exploits Bayesian parameter estimation methods which includes a stopping criterion based on a desired gate infidelity. We experimentally demonstrate a median gate infidelity of $1.3(1)\cdot10^{-3}$, requiring only $1200\pm500$ experimental cycles, while completing the entire gate calibration procedure in less than one minute. This approach is applicable to other quantum information processor architectures with known or sufficiently characterized theoretical models.

Deterministic correction of qubit loss

Roman Stricker [1], Davide Vodola [2,3], Alexander Erhard [1], Lukas Postler [1], Michael Meth [1], Martin Ringbauer [1], Philipp Schindler [1], Thomas Monz [1,4,2,5,6], Markus Müller, Rainer Blatt [1,7]

Abstract

The loss of qubits - the elementary carriers of quantum information - poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. In this work, we experimentally demonstrate a complete toolbox and the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code. This includes a quantum non-demolition measurement of a qubit loss event that conditionally triggers a restoration procedure, mapping the logical qubit onto a new encoding on the remaining qubits. The demonstrated methods, implemented here in a trapped-ion quantum processor, are applicable to other quantum computing architectures and codes, including leading 2D and 3D topological quantum error correcting codes. These tools complement previously demonstrated techniques to correct computational errors, and in combination constitute essential building blocks for complete and scalable quantum error correction.

Long-range Ising and Kitaev Models: Phases, Correlations and Edge Modes

Davide Vodola [1], Luca Lepori [1,2], Elisa Ercolessi [3], Guido Pupillo [1]

Abstract

We analyze the quantum phases, correlation functions and edge modes for a class of spin-1/2 and fermionic models related to the 1D Ising chain in the presence of a transverse field. These models are the Ising chain with anti-ferromagnetic long-range interactions that decay with distance $r$ as $1/r^α$, as well as a related class of fermionic Hamiltonians that generalise the Kitaev chain, where both the hopping and pairing terms are long-range and their relative strength can be varied. For these models, we provide the phase diagram for all exponents $α$, based on an analysis of the entanglement entropy, the decay of correlation functions, and the edge modes in the case of open chains. We demonstrate that violations of the area law can occur for $α\lesssim1$, while connected correlation functions can decay with a hybrid exponential and power-law behaviour, with a power that is $α$-dependent. Interestingly, for the fermionic models we provide an exact analytical derivation for the decay of the correlation functions at every $α$. Along the critical lines, for all models breaking of conformal symmetry is argued at low enough $α$. For the fermionic models we show that the edge modes, massless for $α\gtrsim 1$, can acquire a mass for $α< 1$. The mass of these modes can be tuned by varying the relative strength of the kinetic and pairing terms in the Hamiltonian. Interestingly, for the Ising chain a similar edge localization appears for the first and second excited states on the paramagnetic side of the phase diagram, where edge modes are not expected. We argue that, at least for the fermionic chains, these massive states correspond to the appearance of new phases, notably approached via quantum phase transitions without mass gap closure. Finally, we discuss the possibility to detect some of these effects in experiments with cold trapped ions.