Esteban A. Martinez

Coherent rotations of qubits within a multi-species ion-trap quantum computer

Martin W. van Mourik [1], Esteban A. Martinez [1], Lukas Gerster [1], Pavel Hrmo [1], Thomas Monz [1], Philipp Schindler [1], Rainer Blatt [1,2]

Abstract

We describe, realize, and experimentally investigate a method to perform physical rotations of ion chains, trapped in a segmented surface Paul trap, as a building block for large scale quantum computational sequences. Control of trapping potentials is achieved by parametrizing electrode voltages in terms of spherical harmonic potentials. Voltage sequences that enable crystal rotations are numerically obtained by optimizing time-dependent ion positions and motional frequencies, taking into account the effect of electrical filters in our set-up. We minimize rotation-induced heating by expanding the sequences into Fourier components, and optimizing the resulting parameters with a machine-learning approach. Optimized sequences rotate $^{40}$Ca$^+$ - $^{40}$Ca$^+$ crystals with axial heating rates of $Δ\bar{n}_{com}=0.6^{(+3)}_{(-2)}$ and $Δ\bar{n}_{str}=3.9(5)$ phonons per rotation for the common and stretch modes, at mode frequencies of 1.24 and 2.15 MHz. Qubit coherence loss is 0.2(2)$\%$ per rotation. We also investigate rotations of mixed species crystals ($^{40}$Ca$^+$ - $^{88}$Sr$^+$) and achieve unity success rate.

Compiling quantum algorithms for architectures with multi-qubit gates

Esteban A. Martinez [1], Thomas Monz [1], Daniel Nigg [1], Philipp Schindler [1], Rainer Blatt [1,2]

Abstract

Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a small-scale ion trap quantum information processor. We further adapt the method to state preparation and quantum algorithms with in-sequence measurements.

Realization of a scalable Shor algorithm

Thomas Monz, Daniel Nigg, Esteban A. Martinez, Matthias F. Brandl, Philipp Schindler, Richard Rines, Shannon X. Wang, Isaac L. Chuang, Rainer Blatt

Abstract

Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in 1994 that Peter Shor came up with an algorithm that is able to calculate the prime factors of a large number vastly more efficiently than known possible with a classical computer. This paradigmatic algorithm stimulated the flourishing research in quantum information processing and the quest for an actual implementation of a quantum computer. Over the last fifteen years, using skillful optimizations, several instances of a Shor algorithm have been implemented on various platforms and clearly proved the feasibility of quantum factoring. For general scalability, though, a different approach has to be pursued. Here, we report the realization of a fully scalable Shor algorithm as proposed by Kitaev. For this, we demonstrate factoring the number fifteen by effectively employing and controlling seven qubits and four "cache-qubits", together with the implementation of generalized arithmetic operations, known as modular multipliers. The scalable algorithm has been realized with an ion-trap quantum computer exhibiting success probabilities in excess of 90%.

Experimental Quantum Computations on a Topologically Encoded Qubit

Daniel Nigg [1,2], Markus Mueller, Esteban A. Martinez [1], Philipp Schindler [1], Markus Hennrich [1], Thomas Monz [1,2], Miguel A. Martin-Delgado, Rainer Blatt [1,3]

Abstract

The construction of a quantum computer remains a fundamental scientific and technological challenge, in particular due to unavoidable noise. Quantum states and operations can be protected from errors using protocols for fault-tolerant quantum computing (FTQC). Here we present a step towards this by implementing a quantum error correcting code, encoding one qubit in entangled states distributed over 7 trapped-ion qubits. We demonstrate the capability of the code to detect one bit flip, phase flip or a combined error of both, regardless on which of the qubits they occur. Furthermore, we apply combinations of the entire set of logical single-qubit Clifford gates on the encoded qubit to explore its computational capabilities. The implemented 7-qubit code is the first realization of a complete Calderbank-Shor-Steane (CSS) code and constitutes a central building block for FTQC schemes based on concatenated elementary quantum codes. It also represents the smallest fully functional instance of the color code, opening a route towards topological FTQC.

Can different quantum state vectors correspond to the same physical state? An experimental test

Daniel Nigg [1], Thomas Monz [1], Philipp Schindler [1], Esteban A. Martinez [1], Michael Chwalla [2], Markus Hennrich [1], Rainer Blatt [1,2], Matthew F. Pusey [3], Terry Rudolph [3], Jonathan Barrett

Abstract

A century on from the development of quantum theory, the interpretation of a quantum state is still discussed. If a physicist claims to have produced a system with a particular wave function, does this represent directly a physical wave of some kind, or is the wave function merely a summary of knowledge, or information, about the system? A recent no-go theorem shows that models in which the wave function is not physical, but corresponds only to an experimenter's information about a hypothetical real state of the system, must make different predictions from quantum theory when a certain test is carried out. Here we report on an experimental implementation using trapped ions. Within experimental error, the results confirm quantum theory. We analyse which kinds of theories are ruled out.