We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit simultaneously. In this model, we discuss complexity bounds (lower-bounding the number of global Hadamard operations) for common quantum algorithms : we illustrate upper bounds for Shor's Algorithm, and prove lower bounds for Grover's Algorithm. We also use our formalism to display a gate that is neither quantum-universal nor classically simulable, on the assumption that Integer Factoring is not in BPP.
We establish the non-existence of a universal Hadamard gate for arbitrary unknown qubits, by considering two different principles; namely, no-superluminal signalling and non-increase of entanglement under LOCC. It is also shown that these principles are not violated if and only if the qubit states are of a special form obtained in our recent work [ IJQI (in press), quant-ph/0505068 ].
We consider one possible implementation of Hadamard gate for optical and ion trap holonomic quantum computers. The expression for its fidelity determining the gate stability with respect to the errors in the single-mode squeezing parameter control is analytically derived. We demonstrate by means of this expression the cancellation of the squeezing control errors up to the fourth order on their magnitude.
We propose a quantum state transfer from an atomic qubit to a cat-like qubit by means of one degenerate Raman interaction and one Hadamard gate operation for coherent states. We show that the coefficients of the atomic qubit can be mapped onto coherent state qubit, with an effective qubit state transfer.
We show that the Hadamard and Unitary gates could be implemented by a unitary evolution together with a measurement for any unknown state chosen from a set $A = {{| {Ψ_i} > ,| {\bar Ψ_i} >}}({i = 1,2})$ if and only if $| {Ψ_1} > ,| {Ψ_2} > ,| {\bar Ψ_1} > ,| {\bar Ψ_2} >$ are linearly independent. We also derive the best transformation efficiencies.
Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a 'classical' set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev's universal set of gates, and discuss the meaning of the result.
We discuss and experimentally demonstrate a probabilistic Hadamard gate for coherent state qubits. The scheme is based on linear optical components, non-classical resources and the joint projective action of a photon counter and a homodyne detector. We experimentally characterize the gate for the coherent states of the computational basis by full tomographic reconstruction of the transformed output states. Based on the parameters of the experiment we simulate the fidelity for all coherent state qubits on the Bloch sphere.
We propose the implementation of a deterministic Hadamard gate for logical photonic qubits encoded in superpositions of coherent states of a harmonic oscillator. The proposed scheme builds on a recently introduced set of conditional operations in the strong dispersive regime of circuit QED [Z. Leghtas et al. Phys. Rev. A. {\bf 87} (2013)]. We further propose an architecture for coupling two such logical qubits and provide a universal set of deterministic quantum gates. Based on parameter values taken from the current state of the art, we give estimates for the achievable gate fidelities accoun…
We have implemented a Walsh-Hadamard gate, which performs a quantum Fourier transform, in a superconducting qutrit. The qutrit is encoded in the lowest three energy levels of a capacitively shunted flux device, operated at the optimal flux-symmetry point. We use an efficient decomposition of the Walsh-Hadamard gate into two unitaries, generated by off-diagonal and diagonal Hamiltonians respectively. The gate implementation utilizes simultaneous driving of all three transitions between the three pairs of energy levels of the qutrit, one of which is implemented with a two-photon process. The gat…
We consider the change of entanglement of formation $ΔE$ produced by the Hadamard-CNOT circuit on a general (pure or mixed) state $ρ$ describing a system of two qubits. We study numerically the probabilities of obtaining different values of $ΔE$, assuming that the initial state is randomly distributed in the space of all states according to the product measure recently introduced by Zyczkowski {\it et al.} [Phys. Rev. A {\bf 58} (1998) 883].
We consider protecting a Hadamard operation from independent dephasing, bit flipping, and dissipation. These environment-induced errors are represented by three uncorrelated reservoirs of thermalized bosons and we show that the protection is achievable through continuous dynamical decoupling. We find that, to decouple the Hadamard evolution from the environmental influence, we need a control field of higher frequency if the boson spectral density is super-ohmic than if it is ohmic. We also study the relevance of bit flipping and dissipation to the gate fidelity when it is protected from dephas…
Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires rather complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC--the Fibonacci anyon system--lacks a physical realization, let alone braiding the non-Abelian anyons. Here, we propose a disk model that can realize the Fibonacci anyon system, and c…
The University of Tokyo（东京大学）；Institute for Physics of Intelligence, The University of Tokyo（东京大学物理智能研究所）；Institute for Solid State Physics, The University of Tokyo（东京大学固体物理研究所）
We obtain the most general ensemble of qubits, for which it is possible to design a universal Hadamard gate. These states when geometrically represented on the Bloch sphere, give a new trajectory. We further consider some Hadamard `type' of operations and find ensembles of states for which such transformations hold. Unequal superposition of a qubit and its orthogonal complement is also investigated.
The solving of linear systems provides a rich area to investigate the use of nearer-term, noisy, intermediate-scale quantum computers. In this work, we discuss hybrid quantum-classical algorithms for skewed linear systems for over-determined and under-determined cases. Our input model is such that the columns or rows of the matrix defining the linear system are given via quantum circuits of poly-logarithmic depth and the number of circuits is much smaller than their Hilbert space dimension. Our algorithms have poly-logarithmic dependence on the dimension and polynomial dependence in other natu…
The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely written in the canonical form $F_1HSF_2$, where $H$ is a layer of Hadamard gates, $S$ is a permutation of qubits, and $F_i$ are parameterized Hadamard-free circuits chosen from suitable subgroups of the Clifford group. Our canonical form provides a one-to-one correspondence between Clifford operators and layered quantum circuits. We report a polynomial-time algori…
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis. The result of Gottesman and Knill[quant-ph/9807006] implies that any quantum circuit involving only the Controlled-NOT and Hadamard gates can be efficiently simulated by a classical circuit. In contrast, we prove that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal f…
Hadamard spectroscopy has earlier been used to speed-up multi-dimensional NMR experiments. In this work we speed-up the two-dimensional quantum computing scheme, by using Hadamard spectroscopy in the indirect dimension, resulting in a scheme which is faster and requires the Fourier transformation only in the direct dimension. Two and three qubit quantum gates are implemented with an extra observer qubit. We also use one-dimensional Hadamard spectroscopy for binary information storage by spatial encoding and implementation of a parallel search algorithm.
Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tolerant to a certain degree. We examine its implementation based on Zeeman coupling with a rotating field and isotropic Heisenberg interaction, which describe NMR and can also be realized in quantum dots and cold atoms. Using a novel physical representation of the qubit basis states, we construct $π/8$ and Hadamard gates based on Berry and Aharonov-Anandan phases. For two interacting qubits in a rotating field, we find that it is always impossible to construct a two-qubit gate based on Berry phases…
Consider the problem: Alice wishes to send the same key to $n-1$ users (Bob, Carol,. . . , Nathan), while preventing eavesdropper Eve from acquiring information without being detected. The problem has no solution in the classical cryptography but in quantum telecommunication there are some codes to solve the problem. In the paper \cite{zengetall}, Guo-Jyun Zeng, Kuan-Hung Chen, Zhe-Hua Chang, Yu-Shan Yang, and Yao-Hsin Chou from one side and Cabello in \cite{cabello} from other side, used Hadamard gates, Pauli gates in providing the quantum communication code for two-partity telecommunication …
In this paper, we develop a new classical simulation of quantum bit (qubit) by use of analog components in order to be able to simulate the quantum properties such as the superposition of states. As part of this new approach, we have also implemented many logical gates (Pauli-X, Hadamard, and Conditional phase-shift gates). Simulation of Hadamard and Conditional phase-shift gates using Proteus Design Suite is also presented and discussed in this work.
An efficient quantum Hadamard product algorithm for functions
The University of Tokyo（东京大学）；Quemix Inc.（Quemix公司）；Sumitomo Rubber Industries, Ltd.（住友橡胶工业株式会社）；National Institutes for Quantum Science and Technology (QST)（国立研究開発法人量子科学技術研究機構）
Controlled-NOT (CNOT) gates are commonly included in the standard gate set of quantum processors and provide an important way to entangle qubits. For fixed-frequency qubits using the cross-resonance entangling technique, using the higher-frequency qubit to control the lower-frequency qubit enables much shorter entangling times than using the lower-frequency qubit as the control. Consequently, when implementing a CNOT gate where logical control by the lower-frequency qubit is needed, compilers may implement this functionality by using an equivalent circuit such as placing Hadamard gates on both…
We study decoherence induced by stochastic squeezing control errors considering the particular implementation of Hadamard gate on optical and ion trap holonomic quantum computers. We analytically obtain both the purity of the final state and the fidelity for Hadamard gate when the control noise is modeled by Ornstein-Uhlenbeck stochastic process. We demonstrate the purity and the fidelity oscillations depending on the choice of the initial superimposed state. We derive a linear formulae connecting the gate fidelity and the purity of the final state.
The basic one-bit gates (X, Y, Z, Hadamard, phase, pi/8) as well as the controlled cnot and Toffoli gates are reformulated in the language of geometric-algebra quantum-like computation. Thus, all the quantum algorithms can be reformulated in purely geometric terms without any need of tensor products.
We theoretically study operations with a four-level superconducting circuit as a two-qubit system. Using a mapping on a two-qubit system, we show how to implement iSWAP gates and Hadamard gates through pulses on transitions between particular pairs of energy levels. Our approach allows one to prepare pure two-qubit entangled states with desired form of reduced density matrices of the same purity and, in particular, arbitrary identical reduced states of qubits. We propose using schemes for the Hadamard gate and two-qubit entangled states with identical reduced density matrices in order to verif…
We study decoherence induced by stochastic squeezing control errors considering the particular implementation of Hadamard gate on optical and ion trap holonomic quantum computers. We find the fidelity for Hadamard gate and compute the purity of the final state when the control noise is modeled by Ornstein-Uhlenbeck stochastic process. We demonstrate that in contradiction to the case of the systematic control errors the stochastic ones lead to decoherence of the final state. In the small errors limit we derive a simple formulae connecting the gate fidelity and the purity of the final state.
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates (Hadamard and ${σ_z}^{1/4}$), and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of $π$) single-qubit gate, and hence, is potentially the…
An implementation is proposed of single qubit gates, e.g., phase, NOT, \sqrt{NOT} and Hadamard, operating on polarized photons and based on light storage. Instead of processing photons themselves, qubit transformations are performed on atomic excitations due to photon storage in a medium of atoms in the tripod configuration.
We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give algorithms to optimize this type of circuits in some particular cases. Finally we show how to create some usefull entangled states when a CNOT circuit acts on a fully factorized state.
We propose the generalized controlled X (GCX) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and show that it is feasible with current technology. With these elementary gates many important qudit quantum gates can be synthesized conveniently. We provide efficient methods for the synthesis of various kinds of controlled qudit gates and greatly simplify the synthesis of existing generic multi-valued quantum circuits. Moreover, we generalize the quantum Sha…
A Toffoli gate ($C^{n}$-NOT gate) is regarded as an important unitary gate in quantum computation, and is simulated by a quantum circuit composed of $C^{2}$-NOT gates. This paper presents a quantum circuit with a new configuration of $C^{2}$-NOT gates simulating a $C^{2m+1}$-NOT operation under the condition $m=2^{n}$ ($n=1,2,...$). The circuit is composed of units called multi-qubits gates (MQGs), each of which performs $m$ $C^{2}$-NOT operations simultaneously on $3m$ qubits. Simultaneous operations eliminate the need to manipulate qubits individually, as required in conventional quantum cir…
This is a brief overview of quantum holonomies in the context of quantum computation. We choose an adequate set of quantum logic gates, namely, a phase gate, the Hadamard gate, and a conditional-phase gate and show how they can be implemented by purely geometric means. Such gates may be more resilient to certain types of errors.
In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to transform the discrete combinatorial problem of circuit synthesis into an optimization problem over continuous variables. The circuit is then compressed by a sequential removal of two-qubit gates from the design, while the remaining building blocks are continuously adapted to the reduced gate structure by iterated learning cycles. We implemented the develope…
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of quantum circuits because of their high error rate as compared with single-qubit gates. The controlled-not (CNOT) gate is the typical choice of a two-qubit gate for universal quantum circuit implementation together with the set of single-qubit gates. In this study, we construct a one-dimensional nearest-neighbor circuit of quantum Fourier transform (QFT), which i…
The first separation between quantum polynomial time and classical bounded-error polynomial time was due to Bernstein and Vazirani in 1993. They first showed a O(1) vs. Omega(n) quantum-classical oracle separation based on the quantum Hadamard transform, and then showed how to amplify this into a n^{O(1)} time quantum algorithm and a n^{Omega(log n)} classical query lower bound. We generalize both aspects of this speedup. We show that a wide class of unitary circuits (which we call dispersing circuits) can be used in place of Hadamards to obtain a O(1) vs. Omega(n) separation. The class of dis…
We consider how the Hamiltonian Quantum Computing scheme introduced in [arXiv:1509.01278] can be implemented using a 2D array of superconducting transmon qubits. We show how the scheme requires the engineering of strong attractive cross-Kerr and weak flip-flop or hopping interactions and we detail how this can be achieved. Our proposal uses a new electric circuit for obtaining the attractive cross-Kerr coupling between transmons via a dipole-like element. We discuss and numerically analyze the forward motion and execution of the computation and its dependence on coupling strengths and their va…
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as well as the NOT gate and multiply-controlled-Z gates, we describe a systematic approach to identifying the set of U(2) rotations required to implement each gate for any qudit of size N and with minimal use of an ancilla level. The qudit gates are analyzed in terms of the total rotation count and gate depth as the system scales with D. We apply the qudit-basi…
In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by arbitrary one-qutrit gates. It is primitive, efficient and easy to implement. Based on Cartan decomposition, we also give the one-qutrit elementary gates. Then the synthesis of some important ternary gates is investigated and the scheme of physical implementation for these ternary gates is discussed. Finally we extend these elementary gates to more general qudit ca…
In this work, we introduce a new circuit optimization technique to reduce the number of T gates in Clifford+T circuits by treating T gates conjugated by Clifford gates as $\fracπ{4}$-rotations around Pauli operators. The tested benchmarks shows up to $71.43\%$ and an average $42.67\%$ reduction in T-count, both surpass the best performance reported. The worst case complexity of our algorithm is $O(nk^2)$ where $n$ is the number of qubits and $k$ is the number of T gates in the original Clifford+T circuit.
Emerging models of quantum computation driven by multi-photon quantum interference, while not universal, may offer an exponential advantage over classical computers for certain problems. Implementing these circuits via geometric phase gates could mitigate requirements for error correction to achieve fault tolerance while retaining their relative physical simplicity. We report an experiment in which a geometric phase is embedded in an optical network with no closed-loops, enabling quantum interference between two photons as a function of the phase.
This is an exposition of some basic mathematical aspects of quantum logic gates. At first we established some general formulas for the case of arbitrary quantum gate A with unique restriction A^2=I. The explicit form of the generators and roots of matrix A have been found . Then we apply general results to the particular cases of one-qubit and multi-qubit quantum gates. Some interesting properties of square roots of basic Pauli and Hadamard gates are demonstrated.
