相关论文: Optical Holonomic Quantum Computation
One of the most promising nascent technologies, quantum computation faces a major challenge: The need for stable computational building blocks. We present the quantum-optical realization of non-adiabatic holonomies that can be used as…
We present a general unified approach for finding the coherent states of polynomially deformed algebras such as the quadratic and Higgs algebras, which are relevant for various multiphoton processes in quantum optics. We give a general…
Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…
A `register' in quantum information processing -- is composition of k quantum systems, `qudits'. The dimensions of Hilbert spaces for one qudit and whole quantum register are d and d^k respectively, but we should have possibility to prepare…
We present a scheme to study non-abelian adiabatic holonomies for open Markovian systems. As an application of our framework, we analyze the robustness of holonomic quantum computation against decoherence. We pinpoint the sources of error…
Quantum systems with adiabatic classical parameters are widely studied, e.g., in the modern holonomic quantum computation. We here provide complete geometric quantization of a Hamiltonian system with time-dependent parameters, without the…
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,…
Recently it was realized that linear optics and photo-detectors with feedback can be used for theoretically efficient quantum information processing. The first of three steps toward efficient linear optics quantum computation (eLOQC) was to…
It has been recently found that the equations of motion of several semiclassical systems must take into account anomalous velocity terms arising from Berry phase contributions. Those terms are for instance responsible for the spin Hall…
A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed…
Umbral calculus can be viewed as an abstract theory of the Heisenberg commutation relation $[\hat P,\hat M]=1$. In ordinary quantum mechanics $\hat P$ is the derivative and $\hat M$ the coordinate operator. Here we shall realize $\hat P$ as…
Non-Abelian geometric phases form the foundation of fault-tolerant holonomic quantum computation. An "all-geometric" approach leveraging these phases enables robust unitary operations in condensed matter systems. Photonics, with rich…
We present a general unified approach for finding the coherent states of polynomially deformed algebras such as the quadratic and Higgs algebras, which are relevant for various multiphoton processes in quantum optics. We give a general…
We exactly construct one- and two-qubit holonomic quantum gates in terms of isospectral deformations of an Ising model Hamiltonian. A single logical qubit is constructed out of two spin-1/2 particles; the qubit is a dimer. We find that the…
We suggest an efficient scheme for quantum computation with linear optical elements utilizing "linked" photon states. The linked states are designed according to the particular quantum circuit one wishes to process. Once a linked-state has…
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
This paper presents a quantum algorithm for efficiently decoding hypervectors, a crucial process in extracting atomic elements from hypervectors - an essential task in Hyperdimensional Computing (HDC) models for interpretable learning and…
One of the main problems that optical quantum computing has to overcome is the efficient construction of two-photon gates. Theoretically these gates can be realized using Kerr-nonlinearities, but the techniques involved are experimentally…
By using transitionless quantum driving algorithm (TQDA), we present an efficient scheme for the shortcuts to the holonomic quantum computation (HQC). It works in decoherence-free subspace (DFS) and the adiabatic process can be speeded up…
Holonomies are of great interest to quantum computation and simulation. The geometrical nature of these entities offers increased stability to quantum gates. Furthermore, symmetries of particle physics are naturally reflected in holonomies,…