Composite nonadiabatic holonomic quantum computation

Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to error sources as well as the resource expenditure. In this paper, we propose an alternative protocol for nonadiabatic holonomic quantum computation in decoherence-free subspaces, in which an arbitrary one-qubit gate in decoherence-free subspaces is realized by a single-shot implementation. The present protocol not only maintains the merits of the original protocol, but also avoids the extra work of combining two gates to implement an arbitrary one-qubit gate and thereby reduces the exposure time to various error sources.

A cavity QED implementation of the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with nitrogen-vacancy centers coupled commonly to the whispering-gallery mode of a microsphere cavity, where a universal set of quantum gates can be realized on the qubits. In our implementation, with the assistant of the appropriate driving fields, the quantum evolution is insensitive to the cavity field state, which is only virtually excited. The implemented non-adiabatic holonomies, utilizing optical transitions in the Λ type of three-level configuration of the nitrogen-vacancy centers, can be used to construct a universal set of quantum gates on the encoded logical qubits. Therefore, our scheme opens up the possibility of realizing universal holonomic quantum computation with cavity assisted interaction on solid-state spins characterized by long coherence times.

Non-adiabatic holonomic quantum gate in decoherence-free subspaces is of greatly practical importance due to its built-in fault tolerance, coherence stabilization virtues, and short run-time. Here, we propose some compact schemes to implement two- and three-qubit controlled unitary quantum gates and Fredkin gate. For the controlled unitary quantum gates, the unitary operator acting on the target qubit is an arbitrary single-qubit gate operation. The controlled quantum gates can be directly implemented by utilizing non-adiabatic holonomy in decoherence-free subspaces and the required resource for the decoherence-free subspace encoding is minimal by using only two neighboring physical qubits undergoing collective dephasing to encode a logical qubit.

The main obstacles to the realization of high-fidelity quantum gates are the\ncontrol errors arising from inaccurate manipulation of a quantum system and the\ndecoherence caused by the interaction between the quantum system and its\nenvironment. Nonadiabatic holonomic quantum computation allows for high-speed\nimplementation of whole-geometric quantum gates, making quantum computation\nrobust against control errors. Dynamical decoupling provides an effective\nmethod to protect quantum gates against environment-induced decoherence,\nregardless of collective decoherence or independent decoherence. In this paper,\nwe put forward a protocol of nonadiabatic holonomic quantum computation\nprotected by dynamical decoupling . Due to the combination of nonadiabatic\nholonomic quantum computation and dynamical decoupling, our protocol not only\npossesses the intrinsic robustness against control errors but also protects\nquantum gates against environment-induced decoherence.\n

We examine the validity of the rotating wave approximation (RWA) in non-adiabatic holonomic single-qubit gates [New J. Phys. {\bf 14}, 103035 (2012)]. We demonstrate that the adoption of RWA may lead to a sharp decline in fidelity for rapid gate implementation and small energy separation between the excited and computational states. The validity of the RWA in the recent experimental realization [Nature (London) {\bf 496}, 482 (2013)] of non-adiabatic holonomic quantum computation for a superconducting qubit is examined.

A fundamental requirement of quantum information processing is the protection from the adverse effects of decoherence and noise. Decoherence-free subspaces and geometric processing are important steps of quantum information protection. Here, we provide a new experimentally feasible scheme to combine decoherence-free subspaces with nonadiabatic geometric manipulations to attain a universal quantum computation. The proposed scheme is different from previous proposals and is based on the typical XY interaction coupling, which can be set up in various nano-engineered systems and therefore open up for realization of nonadiabatic holonomic quantum computation in decoherence-free subspaces.

Because of its geometric nature, holonomic quantum computation is fault tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open challenge. In this Letter, we report the first experimental demonstration of nonadiabatic holonomic quantum computation in a liquid NMR quantum information processor. Two noncommuting one-qubit holonomic gates, rotations about x and z axes, and the two-qubit holonomic CNOT gate are realized by evolving the work qubits and an ancillary qubit nonadiabatically. The successful realizations of these universal elementary gates in nonadiabatic holonomic quantum computation demonstrates the experimental feasibility of this quantum computing paradigm.

The nonadiabatic geometric quantum computation is promising as it is robust against certain types of local noises. However, its experimental implementation is challenging due to the need of complex control on multi-level and/or multiple quantum systems. Here, we propose to implement it on a two-dimensional square superconducting qubit lattice. In the construction of our geometric quantum gates, we only use the simplest and experimentally accessible control over the qubit states of the involved quantum systems, without introducing any auxiliary state. Specifically, our scheme is achieved by parametrically tunable all-resonant interaction, which leads to high-fidelity quantum gates. Meanwhile, this simple implementation can be conveniently generalized to a composite scenario, which can further suppress the systematic error during the gate operations. In addition, universal nonadiabatic geometric quantum gates in decoherence-free subspace can also be realized based on the tunable coupling between only two transmon qubits, without consulting to multiple qubits and only using two physical qubits to encode a logical qubit. Therefore, our proposal provides a promising way of high-fidelity geometric manipulation for robust solid-state quantum computation.

We show how to realize nonadiabatic holonomic quantum computation in time-dependent decoherence free subspaces (TDFSs). In our scheme, the holonomy is not generated by computational bases in DFSs but time-dependent bases of TDFSs. Therefore, different from the traditional DFSs, the ancillary systems are not necessary in inducing holonomy, which saves qubits used in the holonomic quantum computation. We also analyze the symmetry of the N-qubits system which couples to a common squeezed field. The results show that, there are several independent DFSs presented in Hilbert space, which is determined by eigenvalues of Lindblad operators. Combining the scheme and the model proposed in this paper, we show that, the one-qubit controllable phase gate can be realized by only two physical qubits.

Precise Point Positioning (PPP) is an increasingly recognized precisely the GPS/GNSS positioning technique. In order to improve the accuracy of PPP, the error sources in PPP measurements should be reduced as much as possible and the ambiguities should be correctly resolved. The correct ambiguity resolution requires a careful control of residual errors that are normally categorized into random and systematic errors. To understand effects from two categorized errors on the PPP ambiguity resolution, those two GPS datasets are simulated by generating in locations in South Korea (denoted as SUWN) and Hong Kong (PolyU). Both simulation cases are studied for each dataset; the first case is that all the satellites are affected by systematic and random errors, and the second case is that only a few satellites are affected. In the first case with random errors only, when the magnitude of random errors is increased, L1 ambiguities have a much higher chance to be incorrectly fixed. However, the size of ambiguity error is not exactly proportional to the magnitude of random error. Satellite geometry has more impacts on the L1 ambiguity resolution than the magnitude of random errors. In the first case when all the satellites have both random and systematic errors, the accuracy of fixed ambiguities is considerably affected by the systematic error. A pseudorange systematic error of 5 cm is the much more detrimental to ambiguity resolutions than carrier phase systematic error of 2 mm. In the 2 nd case when only a portion of satellites have systematic and random errors, the L1 ambiguity resolution in PPP can be still corrected. The number of allowable satellites varies from stations to stations, depending on the geometry of satellites. Through extensive simulation tests under different schemes, this paper sheds light on how the PPP ambiguity resolution (more precisely L1 ambiguity resolution) is affected by the characteristics of the residual errors in PPP observations. The numerical examples recall the PPP data analysts that how accurate the error correction models must achieve in order to get all the ambiguities resolved correctly.

VDI/VDE 2634–1 performance evaluation tests and systematic errors in passive stereo vision systems

Previous schemes of nonadiabatic holonomic quantum computation were focused mainly on realizing a universal set of elementary gates. Multiqubit controlled gates could be built by decomposing them into a series of the universal gates. In this article, we propose an approach for realizing nonadiabatic holonomic multiqubit controlled gates in which a $(n+1)$-qubit controlled-$(\boldsymbol{\mathrm{n}\cdot \mathrm{\sigma}})$ gate is realized by $(2n-1)$ basic operations instead of decomposing it into the universal gates, whereas an $(n+1)$-qubit controlled arbitrary rotation gate can be obtained by combining only two such controlled-$(\boldsymbol{\mathrm{n}\cdot \mathrm{\sigma}})$ gates. Our scheme greatly reduces the operations of nonadiabatic holonomic quantum computation.

A vector control scheme without motor speed and voltage sensors allows high performance speed control of a squirrel-cage induction motor fed by a voltage source PWM inverter, using only a motor primary current sensor.A new scheme for simplifying the system configuration by removing the speed and current regulators is proposed. The effects of setting errors in control parameters on speed control accuracy and torque characteristic are analyzed, and it is clarified that the control performance largely depends on stator resistance deviation in the low speed range.In order to adapt the control parameter dealing with the stator resistance to the actual value, a parameter adaption method is developed by consideration of a magnetizing current deviation characteristic for the setting error. A design method for the parameter adaption system is also clarified, and its control characteristic and effectiveness are verified by digital simulations and experiments.The proposed system is controllable without torque reduction and good speed accuracy, within ±1% from low speed (about 1 Hz), is obtained. This system fits a wide range application and can serve as an alternative to V/f control due to its simple control configuration and good control performance.

A scheduling algorithm called queue length control is proposed to ensure different quality in each of the traffic flows at a network node. This algorithm determines the control parameters (average queue length and its standard deviation) for a queue in advance (and off‐line) by using the M/G/1 model based on the delay target of each queue and then schedules based on these control parameters for each queue. A simulation compares this algorithm to other algorithms and demonstrates that the delay target of each traffic flow could be achieved over a broad range. When the control parameters are determined, although the actual packet length distribution and the packet arrival distribution are assumed to be different, a certain level of performance can be achieved. In other words, the presence of superior robust control characteristics is demonstrated. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 87(3): 87–97, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.10008

Rydberg atoms possess long coherence time and inherent scalability, which makes it promising to implement quantum algorithms. An exact and robust quantum search algorithm (SA) is essential to some practical applications. Here we propose a multisolution three-qubit SA by employing quantum circuit and geometric operations, in which the target states can be successfully searched with the fidelity of at least 99.8$%$ and the geometric operators guarantee robustness against systematic errors. In particular, the geometric three-qubit gate operators employed reduce the implementation time and help to resist against the detrimental influence of decoherence. Moreover, our scheme can be straightforwardly extended to multiqubit cases. We have carried out numerical simulations based on the master equation to illustrate the superiority of our scheme. We consider that our study provides an alternative method for executing quantum SAs with high success probability.