相关论文: Geometric Phase Based Quantum Computation Applied …
Geometric phases are robust against certain types of local noises, and thus provide a promising way towards high-fidelity quantum gates. However, comparing with the dynamical ones, previous implementations of nonadiabatic geometric quantum…
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…
We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product…
We consider a periodically driven quantum system described by a Hamiltonian which is the product of a slowly varying Hermitian operator $V\left(\boldsymbol{\lambda}\left(t\right)\right)$ and a dimensionless periodic function with zero…
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…
Fast and robust quantum gates is the cornerstone of fault-tolerance quantum computation. In this paper, we propose to achieve quantum gates based on non-cyclic geometric evolution. Dynamical phase during the evolution is cancelled by…
The method of geometric quantization is applied to a particle moving on an arbitrary Riemannian manifold $Q$ in an external gauge field, that is a connection on a principal $H$-bundle $N$ over $Q$. The phase space of the particle is a…
In the previous parts of this work, we established the Prequantum Groupoid $\mathbf{T}_\omega$ as the universal geometric container for quantum mechanics. This approach, which we call the "Geometric Quantization by Paths" (GQbP) framework,…
The quantum geometric tensor (QGT) characterizes the Hilbert space geometry of the eigenstates of a parameter-dependent Hamiltonian. In recent years, the QGT and related quantities have found extensive theoretical and experimental utility,…
We consider non-adiabatic transitions in multiple dimensions, which occur when the Born-Oppenheimer approximation breaks down. We present a general, multi-dimensional algorithm which can be used to accurately and efficiently compute the…
Overcoming the time scale limitations of atomistics can be achieved by switching from the state-space representation of Molecular Dynamics (MD) to a statistical-mechanics-based representation in phase space, where approximations such as…
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance and superconducting circuits.…
We suggest a scheme to implement a universal set of non-Abelian geometric transformations for a single logical qubit composed of three superconducting transmon qubits coupled to a single cavity. The scheme utilizes an adiabatic evolution in…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
Geometric phases arise naturally in a variety of quantum systems with observable consequences. They also arise in quantum computations when dressed states are used in gating operations. Here we show how they arise in these gating operations…
The geometric phases of the cyclic states of a generalized harmonic oscillator with nonadiabatic time-periodic parameters are discussed in the framework of squeezed state. It is shown that the cyclic and quasicyclic squeezed states…
In this thesis we provide a uniform treatment of two non-adiabatic geometric phases for dynamical systems of mixed quantum states, namely those of Uhlmann and of Sj\"{o}qvist et al. We develop a holonomy theory for the latter which we also…
Many physically interesting models show a quantum phase transition when a single parameter is varied through a critical point, where the ground state and the first excited state become degenerate. When this parameter appears as a coupling…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
The task of finding optimal protocols that minimize the energetic cost of thermodynamic processes of long yet finite duration $\tau$ is a pressing one. We approach this problem here in a rigorous and systematic fashion by means of the…