相关论文: Geometric Phases and Quantum Computations

We review the field of Optical Quantum Computation, considering the various implementations that have been proposed and the experimental progress that has been made toward realizing them. We examine both linear and nonlinear approaches and…

The prospects of quantum computing have driven efforts to realize fully functional quantum processing units (QPUs). Recent success in developing proof-of-principle QPUs has prompted the question of how to integrate these emerging processors…

We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be realized by using non-Abelian geometric phases. We show how a set of non-adiabatic holonomic one- and two-qubit…

We show how it is possible to realize quantum computations on a system in which most of the parameters are practically unknown. We illustrate our results with a novel implementation of a quantum computer by means of bosonic atoms in an…

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…

Combination of a construction of unambiguous quantum conditions out of the conventional one and a simultaneous quantization of the positions, momenta, angular momenta and Hamiltonian leads to the geometric potential given by the so-called…

The geometric aspects of quantum mechanics are underlined most prominently by the concept of geometric phases, which are acquired whenever a quantum system evolves along a closed path in Hilbert space. The geometric phase is determined only…

High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However,…

This paper generalizes and expands upon the work [Phys. Rev. Lett. 102, 070502 (2009)] where we introduced a scheme for fault-tolerant holonomic quantum computation (HQC) on stabilizer codes. HQC is an all-geometric strategy based on…

Graphical calculi such as the ZH-calculus are powerful tools in the study and analysis of quantum processes, with links to other models of quantum computation such as quantum circuits, measurement-based computing, etc. A somewhat compact…

Necessary and sufficient conditions are given for the construction of a hybrid quantum computer that operates on both continuous and discrete quantum variables. Such hybrid computers are shown to be more efficient than conventional quantum…

We use the benefits and components of classical computers every day. However, there are many types of problems which, as they grow in size, their computational complexity grows larger than classical computers will ever be able to solve.…

We conducted a systematic survey of emerging quantum-HPC platforms, which integrate quantum computers and High-Performance Computing (HPC) systems through co-location. Currently, it remains unclear whether such platforms provide tangible…

We discuss possible applications of the 1-D direct and inverse scattering problem to design of universal quantum gates for quantum computation. The potentials generating some universal gates are described.

Holonomic quantum computation is a quantum computation strategy that promises some built-in noise-resilience features. Here, we propose a scheme for nonadiabatic holonomic quantum computation with nitrogen-vacancy center electron spins,…

Quantum computing promises to tackle technological and industrial problems insurmountable for classical computers. However, today's quantum computers still have limited demonstrable functionality, and it is expected that scaling up to…

A possible connection between quantum computing and Zeta functions of finite field equations is described. Inspired by the 'spectral approach' to the Riemann conjecture, the assumption is that the zeroes of such Zeta functions correspond to…

To implement a set of universal quantum logic gates based on non-Abelian geometric phases, it is a conventional wisdom that quantum systems beyond two levels are required, which is extremely difficult to fulfil for superconducting qubits,…

An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine…

The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. The computational model underlying the QCc is…