No Arabic abstract
We propose a strategy for engineering multi-qubit quantum gates. As a first step, it employs an eigengate to map states in the computational basis to eigenstates of a suitable many-body Hamiltonian. The second step employs resonant driving to enforce a transition between a single pair of eigenstates, leaving all others unchanged. The procedure is completed by mapping back to the computational basis. We demonstrate the strategy for the case of a linear array with an even number N of qubits, with specific XX+YY couplings between nearest neighbors. For this so-called Krawtchouk chain, a 2-body driving term leads to the iSWAP$_N$ gate, which we numerically test for N = 4 and 6.
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such devices. One way to overcome these limitations is to expand the available gate set from single- and two-qubit gates to multi-qubit gates, which entangle three or more qubits in a single step. Here, we show that such multi-qubit gates can be realized by the simultaneous application of multiple two-qubit gates to a group of qubits where at least one qubit is involved in two or more of the two-qubit gates. Multi-qubit gates implemented in this way are as fast as, or sometimes even faster than, the constituent two-qubit gates. Furthermore, these multi-qubit gates do not require any modification of the quantum processor, but are ready to be used in current quantum-computing platforms. We demonstrate this idea for two specific cases: simultaneous controlled-Z gates and simultaneous iSWAP gates. We show how the resulting multi-qubit gates relate to other well-known multi-qubit gates and demonstrate through numerical simulations that they would work well in available quantum hardware, reaching gate fidelities well above 99 %. We also present schemes for using these simultaneous two-qubit gates to swiftly create large entangled states like Dicke and Greenberg-Horne-Zeilinger states.
The assumption that quantum systems relax to a stationary state in the long-time limit underpins statistical physics and much of our intuitive understanding of scientific phenomena. For isolated systems this follows from the eigenstate thermalization hypothesis. When an environment is present the expectation is that all of phase space is explored, eventually leading to stationarity. Notable exceptions are decoherence-free subspaces that have important implications for quantum technologies and have so far only been studied for systems with a few degrees of freedom. Here we identify simple and generic conditions for dissipation to prevent a quantum many-body system from ever reaching a stationary state. We go beyond dissipative quantum state engineering approaches towards controllable long-time non-stationarity typically associated with macroscopic complex systems. This coherent and oscillatory evolution constitutes a dissipative version of a quantum time-crystal. We discuss the possibility of engineering such complex dynamics with fermionic ultracold atoms in optical lattices.
In multi-qubit system, correlated errors subject to unwanted interactions with other qubits is one of the major obstacles for scaling up quantum computers to be applicable. We present two approaches to correct such noise and demonstrate with high fidelity and robustness. We use spectator and intruder to discriminate the environment interacting with target qubit in different parameter regime. Our proposed approaches combines analytical theory and numerical optimization, and are general to obtain smooth control pulses for various qubit systems. Both theory and numerical simulations demonstrate to correct these errors efficiently. Gate fidelities are generally above $0.9999$ over a large range of parameter variation for a set of single-qubit gates and two-qubit entangling gates. Comparison with well-known control waveform demonstrates the great advantage of our solutions.
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.
We analyse the properties of the synchronisation transition in a many-body system consisting of quantum van der Pol oscillators with all-to-all coupling using a self-consistent mean-field method. We find that the synchronised state, which the system can access for oscillator couplings above a critical value, is characterised not just by a lower phase uncertainty than the corresponding unsynchronised state, but also a higher number uncertainty. Just below the critical coupling the system can evolve to the unsynchronised steady state via a long-lived transient synchronised state. We investigate the way in which this transient state eventually decays and show that the critical scaling of its lifetime is consistent with a simple classical model.