相关论文: Time-optimal Hamiltonian simulation and gate synth…
Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a…
In this paper, the problem of synthesizing a general Hermitian quantum gate into a set of primary quantum gates is addressed. To this end, an extended version of the Jacobi approach for calculating the eigenvalues of Hermitian matrices in…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
Geometric quantum gates are often expected to be more resilient than dynamical gates against certain types of error, which would make them ideal for robust quantum computing. However, this is still up for debate due to seemingly conflicting…
We investigate the synthesis of continuous-variable two-mode unitary gates in the setting where two modes A and B are coupled by a fixed quadratic Hamiltonian H. The gate synthesis consists of a sequence of evolutions governed by…
The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous…
The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which…
Estimating extensive combinations of local parameters in distributed quantum systems is a central problem in quantum sensing, with applications ranging from magnetometry to timekeeping. While optimal strategies are known for sensing…
In this paper, we show that the ability to switch globally between two 2-local Hamiltonians on n qubits is sufficient for achieving universal unitary dynamics on those n qubits. Of the two Hamiltonians used in the construction, one is…
The ability to simulate a fermionic system on a quantum computer is expected to revolutionize chemical engineering, materials design, nuclear physics, to name a few. Thus, optimizing the simulation circuits is of significance in harnessing…
We present tools and methods to generalize parity compilation to digital quantum computing devices with arbitrary connectivity graphs and construct circuit implementations for the constraint Hamiltonian of higher-order constrained binary…
This thesis explores the concept of realizing quantum gates using physical systems like atoms and oscillators perturbed by electric and magnetic fields. The basic idea is that if a time-independent Hamiltonian $H_0$ is perturbed by a…
We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by…
We give analytical solutions for the time-optimal synthesis of entangling gates between indirectly coupled qubits 1 and 3 in a linear spin chain of three qubits subject to an Ising Hamiltonian interaction with equal coupling $J$ plus a…
Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate…
The main challenges in achieving high-fidelity quantum gates are to reduce the influence of control errors caused by imperfect Hamiltonians and the influence of decoherence caused by environment noise. To overcome control errors, a…
We propose novel methods for the exact synthesis of single-qubit unitaries with high success probability and gate fidelity, considering both time-bin and frequency-bin encodings. The proposed schemes are experimentally implementable with a…
Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum…
We present a unitary control pulse design method for a scalable quantum computer architecture based on electron spins in lateral quantum dots. We employ simultaneous control of spin interactions and derive the functional forms of spin…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…