相关论文: Time-optimal Hamiltonian simulation and gate synth…

We analytically determine the minimal time and the optimal control laws required for the realization, up to an assigned fidelity and with a fixed energy available, of entangling quantum gates ($\mathrm{CNOT}$) between indirectly coupled…

While quantum simulation is one of the most promising applications of modern quantum devices, accessible simulation times are fundamentally limited by finite coherence times due to omnipresent noise. Based on the ideas of relational…

We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…

The non-adiabatic holonomic quantum computation with the advantages of fast and robustness attracts widespread attention in recent years. Here, we propose the first scheme for realizing universal single-qubit gates based on an…

We study necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues and based on the algebraic-geometric invariants introduced in [1-2]. Our results indicate…

Non Abelian geometric phases are attracting increasing interest because of possible experimental application in quantum computation. We study the effects of the environment (modelled as an ensemble of harmonic oscillators) on a holonomic…

Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…

We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…

In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to…

Despite major ongoing advancements in neutral atom hardware technology, there remains limited work in systems-level software tailored to overcoming the challenges of neutral atom quantum computers. In particular, most current neutral atom…

We present the problem of approximating the time-evolution operator $e^{-i\hat{H}t}$ to error $\epsilon$, where the Hamiltonian $\hat{H}=(\langle G|\otimes\hat{\mathcal{I}})\hat{U}(|G\rangle\otimes\hat{\mathcal{I}})$ is the projection of a…

Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materials, where intricate quantum effects give rise to…

Local implementation of non-local quantum gates is necessary in a distributed quantum computer. Here, we demonstrate the non-local implementation of controlled-unitary quantum gates proposed by Eisert et al. (Phys Rev A 62:052317, 2000)…

In this paper we develop a classical algorithm of complexity $O(K \, 2^n)$ to simulate parametrized quantum circuits (PQCs) of $n$ qubits, where $K$ is the total number of one-qubit and two-qubit control gates. The algorithm is developed by…

The isoholonomic problem in a homogeneous bundle is formulated and solved exactly. The problem takes a form of a boundary value problem of a variational equation. The solution is applied to the optimal control problem in holonomic quantum…

Decoherence is inevitable when manipulating quantum systems. It decreases the quality of quantum manipulations and thus is one of the main obstacles for large-scale quantum computation, where high-fidelity quantum gates are needed.…

We study how parallelism can speed up quantum simulation. A parallel quantum algorithm is proposed for simulating the dynamics of a large class of Hamiltonians with good sparse structures, called uniform-structured Hamiltonians, including…

Geometric phase has the intrinsic property of being resistant to some types of local noises as it only depends on global properties of the evolution path. Meanwhile, the non-Abelian geometric phase is in the matrix form, and thus can…

Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…

The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets…