Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0606231 · International Journal of Quantum Information

ON THE NON-EXISTENCE OF A UNIVERSAL HADAMARD GATE

Preeti Parashar

Published Dec 1, 2007• 2 citations
arXivHTMLPDF

Abstract

We establish the non-existence of a universal Hadamard gate for an arbitrary qubit, 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 belong to the special ensemble obtained recently. We then extend the non-existence of the Hadamard operation to a multi-qubit system. In higher dimensions, the analog of the Hadamard gate is the quantum Fourier transform. We show that it is not possible to design this gate for an arbitrary qudit.

DOI
10.1142/s0219749907003304

Related papers

HADAMARD TYPE OPERATIONS FOR QUBITS

Arpita Maitra, Preeti Parashar

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" operations and find ensembles of states for which such transformations hold. The unequal superposition of a qubit and its orthogonal complement is also investigated.

arXiv:quant-ph/0505068•International Journal of Quantum Information•Aug 1, 2006•11 citations

General impossible operations in quantum information

Arun Kumar Pati

We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal superposition of the original and its complement state. Surprisingly, we find that Hadamard transformations exist for an unknown qubit chosen either from the polar or equatorial great circles. Also, we show that for an unknown qubit one cannot design a universal unitary gate for creating unequal superpositions of the original and its complement state. We discuss why it is impossible to design a controlled-NOT gate for two unknown qubits and discuss the implications of these limitations. 03.67.Hk, 03.65.Ta

arXiv:quant-ph/0111153•Physical Review A•Dec 30, 2002•50 citations

Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform

Francesco Pudda, Mario Chizzini, Crippa, Luca

Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels $d$, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary $d$, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.

arXiv:2410.05122•Oct 7, 2024•0 citations

Single qubit, two qubit gates and no signalling principle

Indranil Chakrabarty

In this work we investigate that whether one can construct single and two qubit gates for arbitrary quantum states from the principle of no signalling. We considered the problem for Pauli gates, Hadamard gate, C-Not gate.

arXiv:quant-ph/0605185•May 22, 2006•0 citations

On Universality of Quantum Fourier Transform

Arpita Maitra, Santanu Sarkar

A methodology is presented to obtain the basis of qudits which are admissible to quantum Fourier transform (QFT) in the sense that the set of such kets are related by the QFT in the same way as the kets of the computational basis. We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for two dimension). In this regard we identify certain incompleteness in the result of Maitra and Parashar (Int. J. Quantum Inform. 4 (2006) 653). Next we characterize the ensemble of qutrits for which QFT is possible. Further, some theoretical results related to higher dimensions are also discussed. Considering the unitary matrix U n related to QFT, the issue boils down to the problem of characterizing matrices that commute with U n .

arXiv:1109.4462•Chinese Physics Letters•Mar 1, 2012•1 citation

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

Benjamin D. M. Jones, Noah Linden, Paul Skrzypczyk

We consider models of quantum computation that involve operations performed on some fixed resourceful quantum state. Examples that fit this paradigm include magic state injection and measurement-based approaches. We introduce a framework that incorporates both of these cases and focus on the role of coherence (or superposition) in this context, as exemplified through the Hadamard gate. We prove that given access to incoherent unitaries (those that are unable to generate superposition from computational basis states, e.g. CNOT, diagonal gates), classical control, computational basis measurements, and any resourceful ancillary state (of arbitrary dimension), it is not possible to implement any coherent unitary (e.g. Hadamard) exactly with non-zero probability. We also consider the approximate case by providing lower bounds for the induced trace distance between the above operations and n Hadamard gates. To demonstrate the stability of this result, this is then extended to a similar no-go result for the case of using k Hadamard gates to exactly implement n>k Hadamard gates.

arXiv:2312.03515•Quantum•Sep 11, 2024•5 citations
We establish the non-existence of a universal Hadamard gate for an arbitrary qubit, 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 belong to the special ensemble obtained recently. We then extend the non-existence of the Hadamard operation to a multi-qubit system. In higher dimensions, the analog of the Hadamard gate is the quantum Fourier transform. We show that it is not possible to design this gate for an arbitrary qudit.
We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal superposition of the original and its complement state. Surprisingly, we find that Hadamard transformations exist for an unknown qubit chosen either from the polar or equatorial great circles. Also, we show that for an unknown qubit one cannot design a universal unitary gate for creating unequal superpositions of the original and its complement state. We discuss why it is impossible to design a controlled-NOT gate for two unknown qubits and discuss the implications of these limitations. 03.67.Hk, 03.65.Ta
Quantum computing with qudits, quantum systems with d>2d > 2d>2 levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels ddd, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary ddd, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.
A methodology is presented to obtain the basis of qudits which are admissible to quantum Fourier transform (QFT) in the sense that the set of such kets are related by the QFT in the same way as the kets of the computational basis. We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for two dimension). In this regard we identify certain incompleteness in the result of Maitra and Parashar (Int. J. Quantum Inform. 4 (2006) 653). Next we characterize the ensemble of qutrits for which QFT is possible. Further, some theoretical results related to higher dimensions are also discussed. Considering the unitary matrix U n related to QFT, the issue boils down to the problem of characterizing matrices that commute with U n .
We consider models of quantum computation that involve operations performed on some fixed resourceful quantum state. Examples that fit this paradigm include magic state injection and measurement-based approaches. We introduce a framework that incorporates both of these cases and focus on the role of coherence (or superposition) in this context, as exemplified through the Hadamard gate. We prove that given access to incoherent unitaries (those that are unable to generate superposition from computational basis states, e.g. CNOT, diagonal gates), classical control, computational basis measurements, and any resourceful ancillary state (of arbitrary dimension), it is not possible to implement any coherent unitary (e.g. Hadamard) exactly with non-zero probability. We also consider the approximate case by providing lower bounds for the induced trace distance between the above operations and n Hadamard gates. To demonstrate the stability of this result, this is then extended to a similar no-go result for the case of using k Hadamard gates to exactly implement n>k Hadamard gates.