Related papers: iSWAP-type geometric gates induced by paths on Sch…
Realization of fast fault-tolerant quantum gates on a single spin is the core requirement for solid-state quantum-information processing. As polarized light shows geometric interference, spin coherence is also geometrically controlled with…
We present how a phase factor is generated when an electric dipole moves along a closed trajectory inside a magnetic field gradient. The similarity of this situation with charged particles in a magnetic field can be employed to simulate…
We solve the Jaynes-Cummings Hamiltonian with time-dependent coupling parameters under dipole and rotating-wave approximation for a three-dimensional (3D) photonic crystal (PC) single mode cavity with a sufficiently high quality (Q) factor.…
Three-qubit gates are highly beneficial operations in quantum computing, enabling compact implementations of quantum algorithms and efficient generation of multipartite entangled states. However, realizing such gates with high fidelity…
By considering the most general metric which can occur on a contractable two dimensional symplectic manifold, we find the most general Hamiltonians on a two dimensional phase space to which equivariant localization formulas for the…
We propose a geometric model predictive control framework for quantum systems subject to smoothness and state constraints. By formulating quantum state evolution intrinsically on the projective Hilbert space, we penalize covariant…
The possibility of realization of quantum gates by means of the non-adiabatic geometric phase is considered. It is shown that the non-adiabatic phase can be used for quantum gates realization as well as the adiabatic one.
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
Reliable quantum information processing requires high-fidelity universal manipulation of quantum systems within the characteristic coherence times. Non-adiabatic holonomic quantum computation offers a promising approach to implement fast,…
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…
Due to its significant application in reducing algorithm depth, fSim gates have attracted a lot of attention. However, during the implementation of quantum gates, fluctuations in control parameters and decoherence caused by the environment…
We consider bosonic condensates of exciton-polaritons optically confined in elliptical traps. A superposition of two non-degenerated \textit{p}-type states of the condensate oriented along the two main axes of the trap is represented by a…
A protocol for generating Greenberger-Horne-Zeilinger states in a system of $N$ coupled qubits is proposed. The Hamiltonian model assumes $N$-wise interactions between the $N$ qubits and the presence of a controllable time-dependent field…
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
Quantum gates are crucial for processing quantum information, but implementing them in a photonic platform poses unique challenges due to the peculiar way photons propagate and interfere. Here, we examine quantum photonic gates that utilize…
Quantum gates based on geometric phases possess intrinsic noise-resilience features and therefore attract much attention. However, the implementations of previous geometric quantum computation typically require a long pulse time of gates.…
We propose a simplified mathematical construction of the quantum Fourier transform which is suited for systems described by Ising-type Hamiltonians. By contrast to the standard Cooley-Tuckey scheme, which prescribes sequences of CPHASE…
The first realization of solid state quantum computer was demonstrated recently by using artificial atoms -- transmons in superconducting resonator. Here, we propose a novel architecture of flexible and scalable quantum computer based on a…
We propose a scheme to implement geometric entangling gates for two logical qubits in a coupled cavity system in decoherence-free subspaces. Each logical qubit is encoded with two atoms trapped in a single cavity and the geometric…