Realising large-scale quantum computation in the near future will require increasing the number of low-error two-qubit gates that can be implemented on a quantum computer before decoherence. One of the biggest challenges facing current trapped ion quantum computers is implementing high-speed two-qubit operations, whilst increasing the number of qubits. One of the most promising proposals for overcoming current limitations is the use of ultra-fast pulses to implement fast two-qubit gates between nearest-neighbour pairs of ions. In this thesis, I investigate these ‘fast gates’ in two-dimensional arrays of microtraps, each containing a single ion. I argue that two-dimensional architectures allow for a significant reduction in the number of two-qubit gates required for a particular computation, as compared to one-dimensional ion chains. I demonstrate this reduction for a quantum simulation of a 40-mode Fermi-Hubbard Hamiltonian. I develop an efficient scheme that allows fast gates to be numerically optimised for two-dimensional geometries. I find that this optimisation scheme is capable of designing gates that are faster, higher fidelity, and require lower laser repetition rates. Using this scheme, I find that high-speed two-qubit gates can be optimised for two-dimensional architectures, with fidelities well above thresholds required for fault tolerant error correction, around 99.99%. Furthermore, I find that fast gates in these architectures are robust to the presence of large numbers of surrounding ions. Following previous studies [1, 2] which have identified pulse imperfections as a dominant source of error in fast gates, I perform a worst-case error analysis. I find the fast gates presented in this thesis to require very small errors in single-qubit rotations, and I present recommendations for achieving those requirements. I also investigate other experimental considerations, and make recommendations for overcoming other technical challenges in realising fast gates.Realising large-scale quantum computation in the near future will require increasing the number of low-error two-qubit gates that can be implemented on a quantum computer before decoherence. One of the biggest challenges facing current trapped ion quantum computers is implementing high-speed two-qubit operations, whilst increasing the number of qubits. One of the most promising proposals for overcoming current limitations is the use of ultra-fast pulses to implement fast two-qubit gates between nearest-neighbour pairs of ions. In this thesis, I investigate these ‘fast gates’ in two-dimensional arrays of microtraps, each containing a single ion. I argue that two-dimensional architectures allow for a significant reduction in the number of two-qubit gates required for a particular computation, as compared to one-dimensional ion chains. I demonstrate this reduction for a quantum simulation of a 40-mode Fermi-Hubbard Hamiltonian. I develop an efficient scheme that allows fast gates to be numerically optimised for two-dimensional geometries. I find that this optimisation scheme is capable of designing gates that are faster, higher fidelity, and require lower laser repetition rates. Using this scheme, I find that high-speed two-qubit gates can be optimised for two-dimensional architectures, with fidelities well above thresholds required for fault tolerant error correction, around 99.99%. Furthermore, I find that fast gates in these architectures are robust to the presence of large numbers of surrounding ions. Following previous studies [1, 2] which have identified pulse imperfections as a dominant source of error in fast gates, I perform a worst-case error analysis. I find the fast gates presented in this thesis to require very small errors in single-qubit rotations, and I present recommendations for achieving those requirements. I also investigate other experimental considerations, and make recommendations for overcoming other technical challenges in realising fast gates.

Jan 1, 20190 citations

Quantum thermodynamics for quantum computing

Machiel Blok, Gabriel Teixeira Landi

Nature PhysicsJan 27, 20259 citations

Nonequilibrium fluctuations in quantum heat engines: theory, example, and possible solid state experiments

Michele Campisi, Jukka Pekola, Rosario Fazio

We study stochastic energetic exchanges in quantum heat engines. Due to microreversibility, these obey a fluctuation relation, called the heat engine fluctuation relation, which implies the Carnot bound: no machine can have an efficiency greater than Carnot's efficiency. The stochastic thermodynamics of a quantum heat engine (including the joint statistics of heat and work and the statistics of efficiency) are illustrated by means of an optimal two-qubit heat engine, where each qubit is coupled to a thermal bath and a two-qubit gate determines energy exchanges between the two qubits. We discuss possible solid-state implementations with Cooper-pair boxes and flux qubits, quantum gate operations, and fast calorimetric on-chip measurements of single stochastic events.We study stochastic energetic exchanges in quantum heat engines. Due to microreversibility, these obey a fluctuation relation, called the heat engine fluctuation relation, which implies the Carnot bound: no machine can have an efficiency greater than Carnot's efficiency. The stochastic thermodynamics of a quantum heat engine (including the joint statistics of heat and work and the statistics of efficiency) are illustrated by means of an optimal two-qubit heat engine, where each qubit is coupled to a thermal bath and a two-qubit gate determines energy exchanges between the two qubits. We discuss possible solid-state implementations with Cooper-pair boxes and flux qubits, quantum gate operations, and fast calorimetric on-chip measurements of single stochastic events.

arXiv:1412.0898New Journal of PhysicsMar 20, 2015216 citations

Designing fast quantum gates using optimal control with a reinforcement-learning ansatz

Bijita Sarma, Michael J. Hartmann

Fast quantum gates are crucial not only for the contemporary era of noisy intermediate-scale quantum devices but also for the prospective development of practical fault-tolerant quantum computing. Leakage errors, which arise from data qubits jumping beyond the confines of the computational subspace, are the main challenges in realizing nonadiabatically driven, fast gates. In this work, we propose and illustrate the usefulness of reinforcement learning (RL) to generate fast two-qubit gates in practical multilevel superconducting qubits. In particular, we show that the RL controller offers great effectiveness in finding piecewise constant gate-pulse sequences that act on two transmon data qubits coupled by a tunable coupler to generate a controlled- $Z$ (cz) gate with a gate time of 10 ns and an error rate of approximately $4\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$. Using a gradient-based method to solve the same optimization problem often does not achieve high fidelity for such fast gates. However, we show that using the gate pulses discovered by RL as an ansatz for the gradient-based controller can substantially enhance fidelity compared to using RL alone. While for a 10-ns pulse, this improvement is marginal, the combined RL + gradient approach decreases the gate errors below ${10}^{\ensuremath{-}4}$ for a gate of length 20 ns.Fast quantum gates are crucial not only for the contemporary era of noisy intermediate-scale quantum devices but also for the prospective development of practical fault-tolerant quantum computing. Leakage errors, which arise from data qubits jumping beyond the confines of the computational subspace, are the main challenges in realizing nonadiabatically driven, fast gates. In this work, we propose and illustrate the usefulness of reinforcement learning (RL) to generate fast two-qubit gates in practical multilevel superconducting qubits. In particular, we show that the RL controller offers great effectiveness in finding piecewise constant gate-pulse sequences that act on two transmon data qubits coupled by a tunable coupler to generate a controlled-$Z$ (cz) gate with a gate time of 10 ns and an error rate of approximately $4\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$. Using a gradient-based method to solve the same optimization problem often does not achieve high fidelity for such fast gates. However, we show that using the gate pulses discovered by RL as an ansatz for the gradient-based controller can substantially enhance fidelity compared to using RL alone. While for a 10-ns pulse, this improvement is marginal, the combined RL + gradient approach decreases the gate errors below ${10}^{\ensuremath{-}4}$ for a gate of length 20 ns.

arXiv:2312.16358Physical Review AppliedJan 6, 20257 citations

Z

(cz) gate with a gate time of 10 ns and an error rate of approximately $4\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$. Using a gradient-based method to solve the same optimization problem often does not achieve high fidelity for such fast gates. However, we show that using the gate pulses discovered by RL as an ansatz for the gradient-based controller can substantially enhance fidelity compared to using RL alone. While for a 10-ns pulse, this improvement is marginal, the combined RL + gradient approach decreases the gate errors below ${10}^{\ensuremath{-}4}$ for a gate of length 20 ns.