arXiv subjects

Pascal Baßler

Publications and source records attributed to Pascal Baßler.

3 recordsLinked to original sources

arXiv2024

General, efficient, and robust Hamiltonian engineering

Implementing the time evolution under a desired target Hamiltonian is critical for various applications in quantum science. Due to the exponential increase in the number of parameters with system size and experimental imperfections, this task can be challenging in quantum many-body settings. We introduce an efficient and robust scheme to engineer arbitrary local many-body Hamiltonians. To this end, our scheme applies single-qubit $\pi$ or $\pi/2$ pulses to an always-on system Hamiltonian, which we assume to be native to a given platform. These sequences are constructed by efficiently solving a linear program (LP) which minimizes the total evolution time. In this way, we can engineer target Hamiltonians that are only limited by the locality of the interactions in the system Hamiltonian. Based on average Hamiltonian theory and using robust composite pulses, we make our schemes robust against errors, including finite pulse time errors and various control errors. To demonstrate the performance of our scheme, we provide numerical simulations. In particular, we solve the Hamiltonian engineering problem on a laptop for arbitrary two-local Hamiltonians on a 2D square lattice with $196$ qubits in only $60$ seconds. Moreover, we simulate the engineering of general Heisenberg Hamiltonians from Ising Hamiltonians using imperfect single-qubit pulses for smaller system sizes and achieve a fidelity exceeding $99.9\%$, which is orders of magnitude better than non-robust implementations.

quant-ph↗

arXiv2023

Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds

Multi-qubit entangling interactions arise naturally in several quantum computing platforms and promise advantages over traditional two-qubit gates. In particular, a fixed multi-qubit Ising-type interaction together with single-qubit X-gates can be used to synthesize global ZZ-gates (GZZ gates). In this work, we first show that the synthesis of such quantum gates that are time-optimal is NP-hard. Second, we provide explicit constructions of special time-optimal multi-qubit gates. They have constant gate times and can be implemented with linearly many X-gate layers. Third, we develop a heuristic algorithm with polynomial runtime for synthesizing fast multi-qubit gates. Fourth, we derive lower and upper bounds on the optimal GZZ gate-time. Based on explicit constructions of GZZ gates and numerical studies, we conjecture that any GZZ gate can be executed in a time O(n) for n qubits. Our heuristic synthesis algorithm leads to GZZ gate-times with a similar scaling, which is optimal in this sense. We expect that our efficient synthesis of fast multi-qubit gates allows for faster and, hence, also more error-robust execution of quantum algorithms.

quant-ph↗

arXiv2023

Synthesis of and compilation with time-optimal multi-qubit gates

We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it can be switched on and off for individual qubits. Our method yields a time-optimal implementation of the multi-qubit gates. We numerically demonstrate that the total multi-qubit gate time scales approximately linear in the number of qubits. Using this gate synthesis as a subroutine, we provide compilation strategies for important use cases: (i) we show that any Clifford circuit on $n$ qubits can be implemented using at most $2n$ multi-qubit gates without requiring ancilla qubits, (ii) we decompose the quantum Fourier transform in a similar fashion, (iii) we compile a simulation of molecular dynamics, and (iv) we propose a method for the compilation of diagonal unitaries with time-optimal multi-qubit gates, as a step towards general unitaries. As motivation, we provide a detailed discussion on a microwave controlled ion trap architecture with magnetic gradient induced coupling (MAGIC) for the generation of the Ising-type interactions.

quant-ph↗