Ady Stern

We present protocols for preparing two-dimensional abelian and non-abelian topologically ordered states by employing finite depth unitary circuits composed of long-ranged, simultaneous, and mutually commuting two-qubit gates. Our protocols are motivated by recent proposals for circuits in trapped ion systems, which allow each qubit to participate in multiple gates simultaneously. Our circuits are shown to be optimal, in the sense that the number of two-qubit gates and ancilla qubits scales as $O(L^2)$, where $L$ is the linear size of the system. Examples include the ground states of the toric code, certain Kitaev quantum double models, and string net models. Going beyond two dimensions, we extend our scheme to more general Calderbank-Shor-Steane (CSS) codes. As an application, we present protocols for realizing the three-dimensional Haah's code and X-Cube fracton models.

Qubits based on ions trapped in linear radio-frequency traps form a successful platform for quantum computing, due to their high fidelity of operations, all-to-all connectivity and degree of local control. In principle there is no fundamental limit to the number of ion-based qubits that can be confined in a single 1D register. However, in practice there are two main issues associated with long trapped-ion crystals, that stem from the 'softening' of their modes of motion, upon scaling up: high heating rates of the ions' motion, and a dense motional spectrum; both impede the performance of high-fidelity qubit operations. Here we propose a holistic, scalable architecture for quantum computing with large ion-crystals that overcomes these issues. Our method relies on dynamically-operated optical potentials, that instantaneously segment the ion-crystal into cells of a manageable size. We show that these cells behave as nearly independent quantum registers, allowing for parallel entangling gates on all cells. The ability to reconfigure the optical potentials guarantees connectivity across the full ion-crystal, and also enables efficient mid-circuit measurements. We study the implementation of large-scale parallel multi-qubit entangling gates that operate simultaneously on all cells, and present a protocol to compensate for crosstalk errors, enabling full-scale usage of an extensively large register. We illustrate that this architecture is advantageous both for fault-tolerant digital quantum computation and for analog quantum simulations.

Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in carrying out accurate simulations over long evolution times. Here we experimentally demonstrate a method for quantum simulations on a small-scale trapped ions-based quantum simulator. Our method enables quantum simulations of programmable spin-Hamiltonians, using only simple global fields, driving all qubits homogeneously and simultaneously. We measure the evolution of a quantum Ising ring and accurately reconstruct the Hamiltonian parameters, showcasing an accurate and high-fidelity simulation. Our method enables a significant reduction in the required control and depth of quantum simulations, thus generating longer evolution times with higher accuracy.

Quantum computers based on crystals of trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which can be exploited to realize large-scale multiqubit entanglement gates. However, scaling up the number of qubits, $N$, in these systems, while retaining high-fidelity and high-speed operations, is challenging. Specifically, designing multiqubit entanglement gates in long ion crystals of hundreds of ions involves an NP-hard optimization problem, rendering scale-up not only a technological challenge, but also a conceptual challenge. Here we introduce a method that mitigates this challenge, effectively allowing for a polynomial-time design of fast, robust, and programmable entanglement gates, acting on the entire ion-crystal. We show that while the number of simultaneous entanglement operations scales as $N^2$, the gate duration scales as $N$, leading to a scaling advantage. We use our methods to investigate the drive-power requirements and susceptibility to noise and errors of these multiqubit gates. Our method delineates a path towards scaling up quantum computers based on ion-crystals with hundreds of qubits.

Entangling gates are an essential component of quantum computers. However, generating high-fidelity gates, in a scalable manner, remains a major challenge in all quantum information processing platforms. Accordingly, improving the fidelity and robustness of these gates has been a research focus in recent years. In trapped ions quantum computers, entangling gates are performed by driving the normal modes of motion of the ion chain, generating a spin-dependent force. Even though there has been significant progress in increasing the robustness and modularity of these gates, they are still sensitive to noise in the intensity of the driving field. Here we supplement the conventional spin-dependent displacement with spin-dependent squeezing, which enables a gate that is robust to deviations in the amplitude of the driving field. We solve the general Hamiltonian and engineer its spectrum analytically. We also endow our gate with other, more conventional, robustness properties, making it resilient to many practical sources of noise and inaccuracies.

Many-body systems of quantum interacting particles in which time-reversal symmetry is broken give rise to a variety of rich collective behaviors, and are therefore a major target of research in modern physics. Quantum simulators can potentially be used to explore and understand such systems, which are often beyond the computational reach of classical simulation. Of these, platforms with universal quantum control can experimentally access a wide range of physical properties. However, simultaneously achieving strong programmable interactions, strong time-reversal symmetry breaking, and high fidelity quantum control in a scalable manner is challenging. Here we realized quantum simulations of interacting, time-reversal broken quantum systems in a universal trapped-ion quantum processor. Using a scalable scheme that was recently proposed we implemented time-reversal breaking synthetic gauge fields, shown for the first time in a trapped ion chain, along with unique coupling geometries, potentially extendable to simulation of multi dimensional systems. Our high fidelity single-site resolution in control and measurement, along with highly programmable interactions, allow us to perform full state tomography of a ground state showcasing persistent current, and to observe dynamics of a time-reversal broken system with nontrivial interactions. Our results open a path towards simulation of time-reversal broken many-body systems with a wide range of features and coupling geometries.

In recent years, arrays of atomic ions in a linear RF trap have proven to be a particularly successful platform for quantum simulation. However, a wide range of quantum models and phenomena have, so far, remained beyond the reach of such simulators. In this work we introduce a technique that can substantially extend this reach using an external field gradient along the ion chain and a global, uniform driving field. The technique can be used to generate both static and time-varying synthetic gauge fields in a linear chain of trapped ions, and enables continuous simulation of a variety of coupling geometries and topologies, including periodic boundary conditions and high dimensional Hamiltonians. We describe the technique, derive the corresponding effective Hamiltonian, propose a number of variations, and discuss the possibility of scaling to quantum-advantage sized simulators. Additionally, we suggest several possible implementations and briefly examine two: the Aharonov-Bohm ring and the frustrated triangular ladder.

The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate sequences which are exponential in the qubit register size. Furthermore, gate fidelities tend to decrease when acting in larger qubit registers. Thus high-fidelity implementations in large qubit registers is still a prominent challenge. Here we propose and investigate multi-qubit entangling gates for trapped-ions. Our gates couple many qubits at once, allowing to decrease the total number of gates used while retaining a high gate fidelity. Our method employs all of the normal-modes of motion of the ion chain, which allows to operate outside of the adiabatic regime and at rates comparable to the secular ion-trapping frequency. Furthermore we extend our method for generating Hamiltonians which are suitable for quantum analog simulations, such as a nearest-neighbour spin Hamiltonian or the Su-Schrieffer-Heeger Hamiltonian.