相关论文: Hadamard type operations for qubits

The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…

How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…

Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…

We deepen the theory of quasiorthogonal and approximately quasiorthogonal operator algebras through an analysis of the commutative algebra case. We give a new approach to calculate the measure of orthogonality between two such subalgebras…

We define quantum automorphisms and isomorphisms of Hadamard matrices. We show that every Hadamard matrix of size $N\ge 4$ has quantum symmetries and that all Hadamard matrices of a fixed size are mutually quantum isomorphic. These results…

A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ…

A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are…

We explicitly derive a connection between quantum circuits utilising IBM's quantum gate set and multivariate quadratic polynomials over integers modulo 8. We demonstrate that the action of a quantum circuit over input qubits can be written…

We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…

The qubit SWAP gate has been shown to be an integral component of quantum circuitry design. It permutes the states of two qubits and allows for the storage quantum information, teleportation of atomic or ionic states, and is a fundamental…

We propose an approach that enables to use it for construction of rotations of coherent states, in particular, it gives a possibility to construct Hadamard gate for the coherent states. Our approach is based on representation of arbitrary…

The Swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform Swap for the task of…

Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity,…

Quantum walks, whose dynamics is prescribed by alternating unitary coin and shift operators, possess topological phases akin to those of Floquet topological insulators, driven by a time-periodic field. While there is ample theoretical work…

The geometrical description of Quantum Mechanics is reviewed and proposed as an alternative picture to the standard ones. The basic notions of observables, states, evolution and composition of systems are analised from this perspective, the…

Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…

We study a model of quantum computation based on the continuously-parameterized yet finite-dimensional Hilbert space of a spin system. We explore the computational powers of this model by analyzing a pilot problem we refer to as the close…

We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of…

We construct a quantum gate entangler based on selective phase rotation transform. In particular, we established a relation between quantum integral transform and quantum gates entangler in terms of universal controlled gates for…

The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…