Hadamard Gate Research Articles

Prepare Linear Distributions with Quantum Arithmetic Units

Quantum arithmetic logic units (QALUs) perform essential arithmetic operations within a quantum framework, serving as the building blocks for more complex computations and algorithms in quantum computing. In this paper, we present an approach to prepare linear probability distributions with quantum full adders. There are three main steps. Firstly, Hadamard gates are applied to the two input terms, preparing them at quantum states corresponding to uniform distribution. Next, the two input terms are summed up by applying quantum full adder, and the output sum is treated as a signed integer under two’s complement representation. By the end, additional phase −1 is introduced to the negative components. Additionally, we can discard either the positive or negative components with the assistance of the Repeat-Until-Success process. Our work demonstrates a viable approach to prepare linear probability distributions with quantum adders. The resulting state can serve as an intermediate step for subsequent quantum operations.

Emulating quantum computing with optical matrix multiplication

Optical computing harnesses the speed of light to perform vector-matrix operations efficiently. It leverages interference, a cornerstone of quantum computing algorithms, to enable parallel computations. In this work, we interweave quantum computing with classical structured light by formulating the process of photonic matrix multiplication using quantum mechanical principles such as state superposition and subsequently demonstrate a well-known algorithm, namely, Deutsch–Jozsa’s algorithm. This is accomplished by elucidating the inherent tensor product structure within the Cartesian transverse degrees of freedom of light, which is the main resource for optical vector-matrix multiplication. To this end, we establish a discrete basis using localized Gaussian modes arranged in a lattice formation and demonstrate the operation of a Hadamard gate. Leveraging the reprogrammable and digital capabilities of spatial light modulators, coupled with Fourier transforms by lenses, our approach proves adaptable to various algorithms. Therefore, our work advances the use of structured light for quantum information processing.

Verifiable dynamic quantum secret sharing based on generalized Hadamard gate

Verifiable dynamic quantum secret sharing based on generalized Hadamard gate

The Hadamard gate cannot be replaced by a resource state in universal quantum computation

The Hadamard gate cannot be replaced by a resource state in universal quantum computation

A Multiparty Quantum Private Equality Comparison Scheme Relying on |GHZ3⟩ States

In this work, we present a new protocol that accomplishes multiparty quantum private comparison leveraging maximally entangled |GHZ3⟩ triplets. Our intention was to develop a protocol that can be readily executed by contemporary quantum computers. This is possible because the protocol uses only |GHZ3⟩ triplets, irrespective of the number n of millionaires. Although it is feasible to prepare multiparticle entangled states of high complexity, this is overly demanding on a contemporary quantum apparatus, especially in situations involving multiple entities. By relying exclusively on |GHZ3⟩ states, we avoid these drawbacks and take a decisive step toward the practical implementation of the protocol. An important quantitative characteristic of the protocol is that the required quantum resources are linear both in the number of millionaires and the amount of information to be compared. Additionally, our protocol is suitable for both parallel and sequential execution. Ideally, its execution is envisioned to take place in parallel. Nonetheless, it is also possible to be implemented sequentially if the quantum resources are insufficient. Notably, our protocol involves two third parties, as opposed to a single third party in the majority of similar protocols. Trent, commonly featured in previous multiparty protocols, is now accompanied by Sophia. This dual setup allows for the simultaneous processing of all n millionaires’ fortunes. The new protocol does not rely on a quantum signature scheme or pre-shared keys, reducing complexity and cost. Implementation wise, uniformity is ensured as all millionaires use similar private circuits composed of Hadamard and CNOT gates. Lastly, the protocol is information-theoretically secure, preventing outside parties from learning about fortunes or inside players from knowing each other’s secret numbers.

Error-corrected Hadamard gate simulated at the circuit level

We simulate the logical Hadamard gate in the surface code under a circuit-level noise model, compiling it to a physical circuit on square-grid connectivity hardware. Our paper is the first to do this for a logical unitary gate on a quantum error-correction code. We consider two proposals, both via patch-deformation: one that applies a transversal Hadamard gate (i.e. a domain wall through time) to interchange the logical X and Z strings, and another that applies a domain wall through space to achieve this interchange. We explain in detail why they perform the logical Hadamard gate by tracking how the stabilisers and the logical operators are transformed in each quantum error-correction round. We optimise the physical circuits and evaluate their logical failure probabilities, which we find to be comparable to those of a quantum memory experiment for the same number of quantum error-correction rounds. We present syndrome-extraction circuits that maintain the same effective distance under circuit-level noise as under phenomenological noise. We also explain how a SWAP-quantum error-correction round (required to return the patch to its initial position) can be compiled to only four two-qubit gate layers. This can be applied to more general scenarios and, as a byproduct, explains from first principles how the "stepping" circuits of the recent Google paper \cite{McEwenBaconGidney} can be constructed.

Cross-Cap Defects and Fault-Tolerant Logical Gates in the Surface Code and the Honeycomb Floquet Code

We consider the Z2 toric code, surface code, and Floquet code defined on a nonorientable surface, which can be considered as families of codes extending Shor’s nine-qubit code. We investigate the fault-tolerant logical gates of the Z2 toric code in this setup, which corresponds to e↔m exchanging symmetry of the underlying Z2 gauge theory. We find that nonorientable geometry provides a new way for the emergent symmetry to act on the code space, and discover the new realization of the fault-tolerant Hadamard gate of the two-dimensional surface code with a single cross cap connecting the vertices nonlocally along a slit, dubbed a nonorientable surface code. This Hadamard gate can be realized by a constant-depth local unitary circuit modulo nonlocality caused by a cross cap. Via folding, the nonorientable surface code can be turned into a bilayer local quantum code, where the folded cross cap is equivalent to a bilayer twist terminated on a gapped boundary and the logical Hadamard only contains local gates with intralayer couplings when being away from the cross cap, as opposed to the interlayer couplings on each site needed in the case of the folded surface code. We further obtain the complete logical Clifford gate set for a stack of nonorientable surface codes and similarly for codes defined on Klein-bottle geometries. We then construct the honeycomb Floquet code in the presence of a single cross cap, and find that the period of the sequential Pauli measurements acts as a HZ logical gate on the single logical qubit, where the cross cap enriches the dynamics compared with the orientable case. We find that the dynamics of the honeycomb Floquet code is precisely described by a condensation operator of the Z2 gauge theory, and illustrate the exotic dynamics of our code in terms of a condensation operator supported at a nonorientable surface. Published by the American Physical Society 2024

Topologically Protected Quantum Logic Gates with Valley-Hall Photonic Crystals.

Topological photonics provide a promising way to realize more robust optical devices against some defects and environmental perturbations. Quantum logic gates are fundamental units of quantum computers, which are widely used in future quantum information processing. Thus, constructing robust universal quantum logic gates is an important way forward to practical quantum computing. However, the most important problem to be solved is how to construct the quantum-logic-gate-required 2×2 beam splitter with topological protection. Here, the experimental realization of the topologically protected contradirectional coupler is reported, which can be employed to realize the quantum logic gates, including control-NOT and Hadamard gates, on the silicon photonic platform. These quantum gates not only have high experimental fidelities but also exhibit a certain degree of tolerances against certain types of defects. This work paves the way for the development of practical optical quantum computations and signal processing.

A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem

This paper presents an innovative entanglement-based protocol to address the Dining Cryptographers problem, utilizing maximally entangled |GHZn⟩ tuples as its core. This protocol aims to provide scalability in terms of both the number of cryptographers n and the amount of anonymous information conveyed, represented by the number of qubits m within each quantum register. The protocol supports an arbitrary number of cryptographers n, enabling scalability in both participant count and the volume of anonymous information transmitted. While the original Dining Cryptographers problem focused on a single bit of information—whether a cryptographer paid for dinner—the proposed protocol allows m, the number of qubits in each register, to be any arbitrarily large positive integer. This flexibility allows the transmission of additional information, such as the cost of the dinner or the timing of the arrangement. Another noteworthy aspect of the introduced protocol is its versatility in accommodating both localized and distributed versions of the Dining Cryptographers problem. The localized scenario involves all cryptographers gathering physically at the same location, such as a local restaurant, simultaneously. In contrast, the distributed scenario accommodates cryptographers situated in different places, engaging in a virtual dinner at the same time. Finally, in terms of implementation, the protocol accomplishes uniformity by requiring that all cryptographers utilize identical private quantum circuits. This design establishes a completely modular quantum system where all modules are identical. Furthermore, each private quantum circuit exclusively employs the widely used Hadamard and CNOT quantum gates, facilitating straightforward implementation on contemporary quantum computers.

Optimal Hadamard Gate Count for Clifford+ T Synthesis of Pauli Rotations Sequences

The Clifford+ T gate set is commonly used to perform universal quantum computation. In such setup the T gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of fault-tolerant quantum computing it is then crucial to minimize the number of T gates. Many algorithms, yielding effective results, have been designed to address this problem. It has been demonstrated that performing a pre-processing step consisting of reducing the number of Hadamard gates in the circuit can help to exploit the full potential of these algorithms and thereby lead to a substantial T -count reduction. Moreover, minimizing the number of Hadamard gates also restrains the number of additional qubits and operations resulting from the gadgetization of Hadamard gates, a procedure used by some compilers to further reduce the number of T gates. In this work we tackle the Hadamard gate reduction problem, and propose an algorithm for synthesizing a sequence of π /4 Pauli rotations with a minimal number of Hadamard gates. Based on this result, we present an algorithm which optimally minimizes the number of Hadamard gates lying between the first and the last T gate of the circuit.

A quantum blind signature scheme based on dense coding for non-entangled states

In some schemes, quantum blind signatures require the use of difficult-to-prepare multiparticle entangled states. By considering the communication overhead, quantum operation complexity, verification efficiency and other relevant factors in practical situations, this article proposes a non-entangled quantum blind signature scheme based on dense encoding. The information owner utilizes dense encoding and hash functions to blind the information while reducing the use of quantum resources. After receiving particles, the signer encrypts the message using a one-way function and performs a Hadamard gate operation on the selected single photon to generate the signature. Then the verifier performs a Hadamard gate inverse operation on the signature and combines it with the encoding rules to restore the message and complete the verification. Compared with some typical quantum blind signature protocols, this protocol has strong blindness in privacy protection, and higher flexibility in scalability and application. The signer can adjust the signature operation according to the actual situation, which greatly simplifies the complexity of the signature. By simultaneously utilizing the secondary distribution and rearrangement of non-entangled quantum states, a non-entangled quantum state representation of three bits of classical information is achieved, reducing the use of a large amount of quantum resources and lowering implementation costs. This improves both signature verification efficiency and communication efficiency while, at the same time, this scheme meets the requirements of unforgeability, non-repudiation, and prevention of information leakage.

Implementation of Grover’s Algorithm & Bernstein-Vazirani Algorithm with IBM Qiskit

Quantum logic gates differ from classical logic gates as the former involves quantum operators. The conventional gates such as AND, OR, NOT etc., are generally classified as classical gates, however, some of the quantum gates are known as Pauli gates, Toffoli gates and Hadamard gates, respectively. Normally classical states only involve 0 and 1, whereas quantum states involve the superpositions of 0 and 1. Hence, underlying principles of algorithm implementation for classical logic gate and quantum logic gate are indeed different. In this paper, we introduce significant concepts of quantum computations, analyse the discrepancy between classical and quantum gates, compare quantum algorithms using Qiskit against equivalent classical algorithms and analyse their performance in terms of runtime.

Realization of Hadamard gate with twisted magnon modes in synthetic antiferromagnets

Manipulating the polarization of spin waves highlights the potential of antiferromagnetic magnonics in encoding and handling magnon information with high fidelity. Here, we propose a flexible approach to mutually convert polarization states (i.e., Hadamard gate) by incorporating a topological degree of freedom, intrinsic orbital angular momentum (OAM), into twisted spin wave modes within synthetic antiferromagnetic nanodisks. The polarization states of spin waves and the implementation of magnonic logic operations can be electrically read out through combined spin pumping and inverse spin Hall effect, as demonstrated by numerical micromagnetic simulations for CoFeB-based synthetic antiferromagnets. Our findings present an exciting possibility of parallel magnonic computing utilizing topologically protected and magnetic damping-resistance OAM of twisted magnons.

With a Few Square Roots, Quantum Computing Is as Easy as Pi

Rig groupoids provide a semantic model of Π, a universal classical reversible programming language over finite types. We prove that extending rig groupoids with just two maps and three equations about them results in a model of quantum computing that is computationally universal and equationally sound and complete for a variety of gate sets. The first map corresponds to an 8th root of the identity morphism on the unit 1. The second map corresponds to a square root of the symmetry on 1+1. As square roots are generally not unique and can sometimes even be trivial, the maps are constrained to satisfy a nondegeneracy axiom, which we relate to the Euler decomposition of the Hadamard gate. The semantic construction is turned into an extension of Π, called √Π, that is a computationally universal quantum programming language equipped with an equational theory that is sound and complete with respect to the Clifford gate set, the standard gate set of Clifford+T restricted to ≤2 qubits, and the computationally universal Gaussian Clifford+T gate set.

Metasurface-Based Optical Logic Operators Driven by Diffractive Neural Networks.

In this paper, a novel optical logic operator based on the multifunctional metasurface driven by all-optical diffractive neural network is reported, which can perform four principal quantum logic operations (Pauli-X, Pauli-Y, Pauli-Z, and Hadamard gates). The two ground states and are characterized by two orthogonal linear polarization states. The proposed spatial- and polarization-multiplexed all-optical diffractive neural network only contains a hidden layer physically mapped as a metasurface with simple and compact unit cells, which dramatically reduces the volume and computing resources required for the system. The designed optical quantum operator is proven to achieve high fidelities for all four quantum logical gates, up to 99.96% numerically and 99.88% experimentally. The solution will facilitate the construction of large-scale optical quantum computing systems and scalable optical quantum devices.

Quantum Tapsilou—A Quantum Game Inspired by the Traditional Greek Coin Tossing Game Tapsilou

This paper introduces a new quantum game called Quantum Tapsilou that is inspired by the classical traditional Greek coin tossing game tapsilou. The new quantum game, despite its increased complexity and scope, retains the most important characteristic of the traditional game. In the classical game, both players have 14 probability to win. The quantum version retains this characteristic feature, which is that both players have the same probability to win, but only now this probability varies considerably and depends on previous moves and choices. The two most important novelties of Quantum Tapsilou can be attributed to its implementation of entanglement via the use of rotation gates instead of Hadamard gates, which generates Bell-like states with unequal probability amplitudes, and the integral use of groups. In Quantum Tapsilou both players agree on a specific cyclic rotation group of order n, for some sufficiently large n. The game is based on the chosen group, in the sense that both players will draw their moves from its elements. More specifically, both players will pick rotations from this group to realize their actions using the corresponding Ry rotation gates. In the Quantum Tapsilou game, it is equally probable for both players to win. This fact is in accordance with a previous result in the literature showing that quantum games where both players choose their actions from the same group, exhibit perfect symmetry by providing each player with the possibility to pick the move that counteracts the other player’s action.

Double-direction cyclic controlled quantum communication of single-particle states

The purpose of this paper is to investigate the double-direction cyclic (DDC) controlled quantum communication of single-particle states. We construct 13-particle, 19-particle and 16-particle entangled channels via Hadamard gates and controlled-NOT gates, separately. Based on these quantum channels that we construct, three novel theoretical schemes are proposed for achieving four-party DDC controlled quantum teleportation (QT), remote state preparation (RSP) and hybrid quantum communication, respectively. For any of these three schemes, each correspondent can simultaneously teleport two different single-particle states to two other correspondents under the control of the supervisor, which ensures that cyclic controlled quantum communication is implemented simultaneously in both clockwise and anticlockwise directions. Furthermore, the three presented four-party schemes for DDC controlled quantum communication can be extended to scenarios with n (n>3) correspondents. In each of our schemes, the general analysis formulas for both the sender’s manipulations and the receiver’s transformations are respectively given, and the unit success probability of each scheme is achieved. This article requires specific two-particle projective measurement, single-particle von Neumann measurement, Hadamard gate, controlled-NOT gates and Pauli gates, so our schemes can be physically implemented in terms of current technologies. We also analyzed the inherent efficiency, safety, and control power of the proposed schemes, and the results showed that our schemes are good.

Quantum Teleportation and Entanglement of the 5-Qubit State Over a GHZ-Like Channel

Quantum information processing has a wide range of uses, including the solution of complex algorithms, cryptography, dense coding, quantum computation, and quantum teleportation. Quantum entanglement, a phenomenon that is crucial to many different applications of quantum computation, is an essential resource for quantum computation, and the need for quantum circuits that generate entangled states is one of the ongoing needs for constructing quantum computers. In this study, we present a general approach to the design of quantum circuits that produce entangled states. The approach can be applied to the design of various entanglement circuits with any number of qubits (n-qubit systems), and it makes use of a set of CNOT and Hadamard gates, where the number of CNOT gates should always be (n-1) and each gate connects the two adjacent qubits. In this paper, a three-entangled teleportation scheme of a GHZ-like state (named after its inventor Greenberger-Horne-Zeilinger) through three particles as a quantum channel is presented. The probability of successful teleportation depends on the degree of entanglement of GHZ-like states. A 5-qubit quantum teleportation over a GHZ-like channel has also been used. And single-qubit gates are defined, which are Pauli gates. These gates are represented by arrays I, X, Y, and Z. The results in this paper are good and promising theoretical results in the field of quantum entanglement and quantum teleportation using the Mathematica program.

Cosmogenesis as symmetry transformation

We consider the quantized bi-scalar gravity, which may serve as a locally Lorentz invariant cosmological model with varying speed of light and varying gravitational constant. The equation governing the quantum regime for the case of homogeneous and isotropic cosmological setup is a Dirac-like equation which replaces the standard Wheeler–DeWitt equation. We show that particular cosmogenesis may occur as a result of the action of the symmetry transformation which due to Wigner’s theorem can either be unitary or antiunitary. We demonstrate that the transition from the pre-big-bang contraction to the post-big-bang expansion – a scenario that also occurs in string quantum cosmologies – can be attributed to the action of charge conjugation, which belongs to the class of antiunitary transformations. We also demonstrate that the emergence of the two classical expanding post-big-bang universe–antiuniverse pairs, each with opposite spin projections, can be understood as being triggered by the action of a unitary transformation resembling the Hadamard gate.

The ZX-calculus as a language for topological quantum computation

Unitary fusion categories formalise the algebraic theory of topological quantum computation. These categories come naturally enriched in a subcategory of the category of Hilbert spaces, and by looking at this subcategory, one can identify a collection of generators for implementing quantum computation. We represent such generators for the Fibonacci and Ising models, namely the encoding of qubits and the associated braid group representations, with the ZX-calculus and show that in both cases, the Yang–Baxter equation is directly connected to an important rule in the complete ZX-calculus known as the P-rule, which enables one to interchange the phase gates defined with respect to complementary bases. In the Ising case, this reduces to a familiar rule relating two distinct Euler decompositions of the Hadamard gate as Z- and X-phase gates, whereas in the Fibonacci case, we give a previously unconsidered exact solution of the P-rule involving the Golden ratio. We demonstrate the utility of these representations by giving graphical derivations of the single-qubit braid equations for Fibonacci anyons and the single- and two-qubit braid equations for Ising anyons. We furthermore present a fully graphical procedure for simulating and simplifying braids with the ZX-representation of Fibonacci anyons.