Related papers: TE-PAI: Exact Time Evolution by Sampling Random Ci…
To find and realize the optimal evolution between two states is significant both in theory and application. In quantum mechanics, the minimal evolution is bounded by the gap between the largest and smallest eigenvalue of the Hamiltonian. In…
Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum…
The time evolution of quantum many-body systems is one of the most promising applications for near-term quantum computers. However, the utility of current quantum devices is strongly hampered by the proliferation of hardware errors. The…
Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work, we present a polynomially scaling hybrid…
The advent of near-term digital quantum computers could offer us an exciting opportunity to investigate quantum many-body phenomena beyond that of classical computing. To make the best use of the hardware available, it is paramount that we…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing…
In this article, we develop a numerical method to find optimal control pulses that accounts for the separation of timescales between the variation of the input control fields and the applied Hamiltonian. In traditional numerical…
As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient…
We investigate the potential of bio-inspired evolutionary algorithms for designing quantum circuits with specific goals, focusing on two particular tasks. The first one is motivated by the ideas of Artificial Life that are used to reproduce…
We report on our recent efforts to perform realistic simulations of large quantum devices in the time domain. In contrast to d.c. transport where the calculations are explicitly performed at the Fermi level, the presence of time-dependent…
The Hamiltonian of a linearly driven two-level system, or qubit, in the standard rotating frame contains non-commuting terms that oscillate at twice the drive frequency, $\omega$, rendering the task of analytically finding the qubit's time…
A numerical scheme for solving the time-evolution of wave functions under the time dependent Kohn-Sham equation has been developed. Since the effective Hamiltonian depends on the wave functions, the wave functions and the effective…
We describe an algorithm to simulate time evolution using the Multi-scale Entanglement Renormalization Ansatz (MERA) and test it by studying a critical Ising chain with periodic boundary conditions and with up to L ~ 10^6 quantum spins. The…
Quantum phase estimation (QPE) plays a pivotal role in many quantum algorithms, offering provable speedups in applications such as Shor's factoring algorithm. While fault-tolerant quantum algorithms for combinatorial and Hamiltonian…
All elementary Hamiltonians in nature are expected to be invariant under rotation. Despite this restriction, we usually assume that any arbitrary measurement or unitary time evolution can be implemented on a physical system, an assumption…
Quantum computers can perform certain operations exponentially faster than classical computers, but designing quantum circuits is challenging. To that end, researchers used evolutionary algorithms to produce probabilistic quantum circuits…
Fault-tolerant quantum computing typically requires the transpilation of arbitrary quantum circuits into a finite, universal gate set, such as Clifford+T. As a baseline, Diagonal approximation can be used for synthesizing single-qubit Pauli…
We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…