In this article initial steps in an analysis of cyclic networks of quantum logic gates is given. Cyclic networks are those in which the qubit lines are loops. Here we have studied one and two qubit systems plus two qubit cyclic systems connected to another qubit on an acyclic line. The analysis includes the group classification of networks and studies of the dynamics of the qubits in the cyclic network and of the perturbation effects of an acyclic qubit acting on a cyclic network. This is followed by a discussion of quantum algorithms and quantum information processing with cyclic networks of quantum gates, and a novel implementation of a cyclic network quantum memory. Quantum sensors via cyclic networks are also discussed.
We present a formula for an infinite number of universal quantum logic gates, which are $4$ by $4$ unitary solutions to the Yang-Baxter (Y-B) equation. We obtain this family from a certain representation of the cyclic group of order $n$. We then show that this {\it discrete} family, parametrized by integers $n$, is in fact, a small sub-class of a larger {\it continuous} family, parametrized by real numbers $θ$, of universal quantum gates. We discuss the corresponding Yang-Baxterization and related symmetries in the concomitant Hamiltonian.
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 spin-echo process and the adiabatic control can be sped up through shortcut to adiabatic manner. Different from geometric gates based on cyclic evolution, the superiority of non-cyclic scheme is that the operation time is proportional to the rotation angle (but not the geometric phase) of quantum state. Therefore, the non-cyclic scheme becomes fairly fast in the c…
We propose an experimentally feasible scheme to achieve quantum computation based on a pair of orthogonal cyclic states. In this scheme, quantum gates can be implemented based on the total phase accumulated in cyclic evolutions. In particular, geometric quantum computation may be achieved by eliminating the dynamic phase accumulated in the whole evolution. Therefore, both dynamic and geometric operations for quantum computation are workable in the present theory. Physical implementation of this set of gates is designed for NMR systems. Also interestingly, we show that a set of universal geomet…
Overcoming the Speed-Fidelity Trade-off in Fast CZ Gates via Cyclic Control
University of Science and Technology of China（中国科学技术大学）；CAS Center For Excellence in Quantum Information and Quantum Physics（中国科学院量子信息与量子物理学前沿卓越中心）；Laboratory of Quantum Information（量子信息实验室）；Suzhou Institute for Advanced Research, University of Science and Technology of China（中国科学技术大学苏州高等研究院）
Bosonic Cyclic Codes: Trading Stabilizers for Gaussian Non-Clifford Phase Gates
Cornell University（康奈尔大学）；University of California, Berkeley（加州大学伯克利分校）；University of Maryland（马里兰大学）；NIST/University of Maryland（美国国家标准与技术研究院/马里兰大学）；Université de Sherbrooke（舍布鲁克大学）
One of the main challenges in quantum technologies is the ability to control individual quantum systems. This task becomes increasingly difficult as the dimension of the system grows. Here we propose a general setup for cyclic permutations $X_d$ in $d$ dimensions, a major primitive for constructing arbitrary qudit gates. Using orbital angular momentum states as a qudit, the simplest implementation of the $X_d$ gate in $d$ dimensions requires a single quantum sorter $S_d$ and two spiral phase plates. We then extend this construction to a generalised $X_d(p)$ gate to perform a cyclic permutation…
Flag qubits have recently been proposed in syndrome extraction circuits to detect high-weight errors arising from fewer faults. The use of flag qubits allows the construction of fault-tolerant protocols with the fewest number of ancillas known to-date. In this work, we prove some critical properties of CSS codes constructed from classical cyclic codes that enable the construction of a flag fault-tolerant error correction scheme. We then develop fault-tolerant protocols as well as a family of circuits for flag fault-tolerant error correction and operator measurement, requiring only four ancilla…
Recently, it is proposed to do quantum computation through the Berry's phase(adiabatic cyclic geometric phase) shift with NMR (Jones et al, Nature, 403, 869(2000)). This geometric quantum gate is hopefully to be fault tolerant to certain types of errors because of the geometric property of the Berry phase. Here we give a scheme to realize the NMR C-NOT gate through Aharonov-Anandan's phase(non-adiabatic cyclic phase) shift on the dynamic phase free evolution loop. In our scheme, the gate is run non-adiabatically, thus it is less affected by the decoherence. And, in the scheme we have chosen th…
The SWAP gate plays a central role in network designs for qubit quantum computation. However, there is a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of $d$ qudits for $d$ prime.
In [Phys. Rev. Lett. 95, 080502 (2005)], Zheng proposed a scheme for implementing a conditional phase shift via adiabatic passages. The author claims that the gate is "neither of dynamical nor geometric origin" on the grounds that the Hamiltonian does not follow a cyclic change. He further argues that "in comparison with the adiabatic geometric gates, the nontrivial cyclic loop is unnecessary, and thus the errors in obtaining the required solid angle are avoided, which makes this new kind of phase gates superior to the geometric gates." In this Comment, we point out that geometric operations, …
In this paper, we propose a scheme to implement the two-qubit controlled-Z gate via the Stark-tuned Förster interaction of Rydberg atoms, where the Förster defect is driven by a time-dependent electric field of a simple sinusoidal function while the matrix elements of the dipole-dipole interaction are time-independent. It is shown that when the system is initially in a specific state, it makes a cyclic evolution after a preset interaction time, returning to the initial state, but picks up a phase, which can be used for realizing a two-atom controlled-Z gate. Due to the interference of sequenti…
It is proposed that high-speed universal quantum gates can be realized by using non-Abelian holonomic transformation. A cyclic evolution path which brings the system periodically back to a degenerate qubit subspace is crucial to holonomic quantum computing. The cyclic nature and the resulting gate operations are fully dependent on the precise control of driving parameters, such as the modulated envelop function of Rabi frequency and the control phases. We investigate the effects of fluctuations in these driving parameters on the transformation fidelity of a universal set of single-qubit quantu…
For the complete estimation of arbitrary unknown quantum states by measurements, the use of mutually unbiased bases has been well-established in theory and experiment for the past 20 years. However, most constructions of these bases make heavy use of abstract algebra and the mathematical theory of finite rings and fields, and no simple and generally accessible construction is available. This is particularly true in the case of a system composed of several qubits, which is arguably the most important case in quantum information science and quantum computation. In this paper, we close this gap b…
We transfer the concept of linear feed-back shift registers to quantum circuits. It is shown how to use these quantum linear shift registers for encoding and decoding cyclic quantum error-correcting codes.
We present a scheme for implementing the unconventional geometric two-qubit phase gate with nonzero dynamical phase by using the two-channel Raman interaction of two atoms in a cavity. We show that the dynamical phase acquired in a cyclic evolution is proportional to the geometric phase acquired in the same cyclic evolution, hence the the total phase possesses the same geometric features as the geometric phase. In our scheme the atomic excited state is adiabatically eliminated and the operation of the proposed logic gate involves only in the metastable states of the atom and hence is not affec…
We provide a construction for quantum codes (hermitian-self-orthogonal codes over GF(4)) starting from cyclic codes over GF(4^m). We also provide examples of these codes some of which meet the known bounds for quantum codes.
In the quantum-computation scenario, geometric phase-gates are becoming increasingly attractive for their intrinsic fault tolerance to disturbance. With an adiabatic cyclic evolution, Berry phase appears to realize a geometric transformation. Performing the quantum gates as many as possible within the timescale of coherence, however, remains an inconvenient bottleneck due to the systematic errors. Here we propose an accelerated adiabatic quantum gate based on the Berry phase, the transitionless driving, and the dynamical decoupling. It reconciles a high fidelity with a high speed in the presen…
We propose an experimentally feasible scheme to achieve quantum computation based on nonadiabatic geometric phase shifts, in which a cyclic geometric phase is used to realize a set of universal quantum gates. Physical implementation of this set of gates is designed for Josephson junctions and for NMR systems. Interestingly, we find that the nonadiabatic phase shift may be independent of the operation time under appropriate controllable conditions. A remarkable feature of the present nonadiabatic geometric gates is that there is no intrinsic limitation on the operation time, unlike adiabatic ge…
The thesis is mainly about the construction and implementation of cyclic mutually unbiased bases, dealing with different entanglement structures by discussing the related group structures. A recursive construction for Fermat number dimensions is given and related to Wiedemann's conjecture for systems with more than 2048 qubits. The second part of the thesis analyses a quantum public-key encryption scheme.
We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order $q$ then the group has order $q(q-1)$) with probability $1-\varepsilon$ with (polylog) complexity $O(\log(q)^{R}\log(\varepsilon)^{2})$ where $R<\infty.$
We propose a mathematical model of \textit{quantum} transistor in which bandgap engineering corresponds to the tuning of Dirac potential in the complex four-vector form. The transistor consists of $n$-relativistic spin qubits moving in \textit{classical} external electromagnetic fields. It is shown that the tuning of the direction of the external electromagnetic fields generates perturbation on the potential temporally and spatially, determining the type of quantum logic gates. The theory underlying of this scheme is on the proposal of the intertwining operator for Darboux transfomations on on…
The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the starting point and the direction in which gates are executed. The representation supports all the circuits obtained after computing cyclic permutations of an initial quantum gate list. Two circuits, where one has a gate list which is a cyclic permutation of the other, will implement different functions. The main question appears in the context of scalable qua…
The quantum diffusion of a particle in an initially localized state on a cyclic lattice with N sites is studied. Diffusion and reconstruction time are calculated. Strong differences are found for even or odd number of sites and the limit N->infinit is studied. The predictions of the model could be tested with micro - and nanotechnology devices.
The application of high-dimensional quantum systems (qudits) in quantum computing and communications seems to be a promising avenue due to the possibility of increasing the amount of information encoded in one physical carrier. In this work, we propose a method for implementing single-qudit gates for qudits based on light modes with orbital angular momentum. Method for logical qudits encoding, which ensures the quasi-cyclicity of operations, is introduced. Based on the protocol for converting the orbital angular momentum of light in the Raman quantum memory scheme [Vashukevich E.A. et. al. PRA…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such that the desired unitary matrix expressing the algorithm is directly implemented. We demonstrate this by taking the two-qubit Grover's algorithm implemented in NMR quantum computation, whose pseudopure state is generated by cyclic permutations of the state populations. This is the first exact time-optimal solution, to our knowledge, obtained for …
It has been known since the early days of quantum mechanics that hyperbolic secant pulses possess the unique property that they can perform cyclic evolution on two-level quantum systems independently of the pulse detuning. More recently, it was realized that they induce detuning- controlled phases without changing state populations. Here, we experimentally demonstrate the properties of hyperbolic secant pulses on superconducting transmon qubits and contrast them with the more commonly used Gaussian and square waves. We further show that these properties can be exploited to implement phase gate…
We have performed a proof-of-principle experiment in which qubits encoded in the polarization states of single-photons from a parametric down-conversion source were coherently stored and read-out from a quantum memory device. The memory device utilized a simple free-space storage loop, providing a cyclical read-out that could be synchronized with the cycle time of a quantum computer. The coherence of the photonic qubits was maintained during switching operations by using a high-speed polarizing Sagnac interferometer switch.
Topological features in quantum computing provide controllability and noise error avoidance in the performance of logical gates. While such resilience is favored in the manipulation of quantum systems, it is very hard to identify topological features in nature. This paper proposes a scheme where holonomic quantum gates have intrinsic topological features. An ion trap is employed where the vibrational modes of the ions are coherently manipulated with lasers in an adiabatic cyclic way producing geometrical holonomic gates. A crucial ingredient of the manipulation procedures is squeezing of the v…
We provide an initial characterization of pairwise concurrence in quantum states which are invariant under cyclic permutations of party labeling. We prove that maximal entanglement can be entirely described by adjacent pairs, then give explicit descriptions of those states in specific subsets of 4 and 5 qubit states - X states. We also construct a monogamy bound on shared concurrences in the same subsets in 4 and 5 qubits, finding that above non-maximal entanglement thresholds, no other entanglements are possible.
The hardness to solve an unstructured quantum search problem by a standard quantum search algorithm mainly originates from the low efficiency to amplify the amplitude of the marked state by the oracle unitary operation associated with other known quantum operations. In order to bypass the square speedup limitation of a standard quantum search algorithm it is necessary to develop other type of quantum search algorithms. It is described in detail in the paper for a quantum dynamical method to solve the quantum search problems in the cyclic group state space. The binary dynamical representation f…
Causal reasoning is essential to science, yet quantum theory challenges it. Quantum correlations violating Bell inequalities defy satisfactory causal explanations within the framework of classical causal models. What is more, a theory encompassing quantum systems and gravity is expected to allow causally nonseparable processes featuring operations in indefinite causal order, defying that events be causally ordered at all. The first challenge has been addressed through the recent development of intrinsically quantum causal models, allowing causal explanations of quantum processes -- provided th…
Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which are necessary for fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate-time and abrupt pulse control, weakening the gate performance. Here, we propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant-based shortcuts, where universal quantum gates can be induced in one step without path mutation and the gate time is also effectively shortened. …
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 light via the spin-orbit interaction. Here, we show that a geometric spin in a degenerate subspace of a spin-1 electronic system under a zero field in a nitrogen vacancy center in diamond allows implementation of optical non-adiabatic holonomic quantum gates. The geometric spin under quasi-resonant light exposure undergoes a cyclic evolution in the spin-orbi…
We quantitatively differentiate between the spreads of discrete-time quantum and classical random walks on a cyclic graph. Due to the closed nature of any cyclic graph, there is additional "collision"- like interference in the quantum random walk along with the usual interference in any such walk on any graph, closed or otherwise. We find that the quantum walker remains localized in comparison to the classical one, even in the absence of disorder, a phenomenon that is potentially attributable to the additional interference in the quantum case. This is to be contrasted with the situation on ope…
Charging efficiency bursts in a quantum battery with cyclic indefinite causal order
National Cheng Kung University（国立成功大学）；Center for Quantum Frontiers of Research and Technology, NCKU（国立成功大学量子前沿科技研究中心）；University of Rochester（罗切斯特大学）；National Center for Theoretical Sciences（国家理论科学中心）
We propose an experimentally accessible single-photon routing scheme using a $\bigtriangleup$-type three-level atom embedded in quantum multi-channels composed of coupled-resonator waveguides. Via the on-demand classical field applied to the atom, the router can extract a single photon from the incident channel, and then redirect it into another. The efficient functions of perfect reflection of single photon signal in the incident channel is rooted in the coherent resonance and the existence of photonic bound states.
The parameter-shift rule is an approach to measuring gradients of quantum circuits with respect to their parameters, which does not require ancilla qubits or controlled operations. Here, I discuss applying this approach to a wider range of parameterize quantum gates by decomposing gates into a product of standard gates, each of which is parameter-shift rule differentiable.
In this paperwe propose two theoretical schemes for implementation of quantum phase gates by engineering the phase-sensitive dark state of two atoms subjected to Rydberg-Rydberg interaction. Combining the conventional adiabatic techniques and currently developed approaches of phase control, a feasible proposal for implementation of a geometric phase gate is presented, where the conditional phase shift (Berry phase) is achieved by adiabatically and cyclically changing the parameters of the driving fields. Here we find that the geometric phase acquired is related to the way how the relative phas…
As we are approaching actual application of quantum technology, it is essential to exploit the current quantum resources in the best possible way. With this in mind, it might not be beneficial to use the usual standard gate sets, inspired from classical logic gates, when compiling quantum algorithms when other less standardized gates currently perform better. We, therefore, consider a promising native gate, which occurs naturally in superconducting circuits, known as the diamond gate. We show how the diamond gate can be decomposed into standard gates and, using single-qubit gates, can work as …
Non-Abelian geometric phases acquired in cyclic quantum evolution can be utilized as natural resources for constructing robust holonomic gates for quantum information processing. Recently, an extensible holonomic quantum computation (HQC) was proposed and demonstrated in a recent superconducting experiment [T. Yan et al., Phys. Rev. Lett. 122, 080501 (2019)]. However, for the weakly anharmonic system, this HQC was given of low gate fidelity due to leakage to states outside of the computational subspace. Here, we propose a scheme that to construct nonadiabatic holonomic gates via dynamical inva…
We give a quantum gate construction - composed entirely from incidents of the CNOT gate - that generalises the qubit SWAP gate to higher dimensions. This new construction is more regular than and is an improvement on the WilNOT quantum gate construction.
