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

Physics Letters A

Realization of the Hadamard gate based on superposition of the composite solitons

T. Uthayakumar, Usama Al Khawaja

Published Sep 22, 2022• 7 citations
Publisher
DOI
10.1016/j.physleta.2022.128451

Related papers

Achieving Pauli quantum logic gates with composite solitons of the Manakov system

Usama Al Khawaja

Optik•Dec 14, 2024•3 citations

Improving the Circuit Realization of Grover's Quantum Search Algorithm by Replacing Hadamard with √X Gates

Ali Al-Bayaty, Ali Al-Shuwaili, A H Alzubaidi +1 more

Conventionally, the quantum oracular algorithms, such as Deutsch-Jozsa, Bernstein-Vazirani, and Grover, utilize Hadamard gates to create uniform superposition states for the input qubits of an oracle. However, Hadamard gates are non-native (non-supported) gates in all real quantum computers. For this reason, Hadamard gates are considered cost-expensive gates when realizing (transpiling) such algorithms into a real quantum computer. This paper introduces a new methodology for cost-effective transpilation of Grover's algorithm into real quantum computers, by replacing all Hadamard gates with \(\sqrt {\rm{X}}\) gates. In quantum computing, the Hadamard and \(\sqrt {\rm{X}}\) gates create uniform superposition states of a qubit on the X-axis and Y-axis of the Bloch sphere, respectively. Hence, we utilize a different axis of the Bloch sphere to construct a cost-effective realization for the final transpiled circuit of Grover's algorithm. Theoretically, the final transpiled circuit of Grover's algorithm using \(\sqrt {\rm{X}}\) gates has been minimized to approximately 64% than the circuit of Grover's algorithm using Hadamard gates. Experimentally, because of the \(\sqrt {\rm{X}}\) is an IBM native gate, it has been proven that the final transpiled circuit of Grover's algorithm using \(\sqrt {\rm{X}}\) gates always has a lower quantum cost of 6% than the circuit of Grover's algorithm using Hadamard gates, due to the limited layout (architecture) connectivity of the physical neighboring qubits for IBM quantum computers.

International Conference on Computing and Emerging Sciences•Feb 4, 2026•1 citation

On the Role of Hadamard Gates in Quantum Circuits

Dan J. Shepherd

arXiv:quant-ph/0508153•Quantum Information Processing•May 26, 2006•55 citations

Building of one-way Hadamard gate for squeezed coherent states

Sergey A. Podoshvedov

We present an optical scheme to conditionally generate even or odd squeezed superpositions of coherent states (SSCSs). The optical setup consists of an unbalanced beam splitter whose transmittance tends to unity, and additional balanced beam splitters and photodetectors in auxiliary modes. Squeezed coherent states with different amplitudes are the input states in the optical scheme. The single-qubit operations are probabilistic and employ two- and three-photon subtractions from initial beams as the driving force. Generation of the even or odd SSCSs is observed in a wide diapason of values of used parameters. We consider a possibility to realize a one-way Hadamard gate for the squeezed coherent states when the base states are transformed into superposition states. States approximating the output states of a Hadamard gate with high fidelity can be realized by imposing restrictions on the values of used parameters. Higher-order subtractions from input beams are necessary to generate the SSCSs with larger amplitudes and higher fidelities. The problem is resolved in a Wigner representation to take into account imperfections of the optical devices.

Physical Review A•Jan 10, 2013•26 citations

Quantum solitons: experimental progress and perspectives

Andreas Sizmann

Applied Physics B•Dec 1, 1997•18 citations

Realization of the Pauli gate based on superposition of the composite solitons via cold atomic medium

LI Wenzhuo, QIN Lu, ZHANG Yingying +6 more

多态量子逻辑门为提高信息编码维度和增强光场调控能力提供了新思路。我们提出通过复合孤子叠加实现三态量子泡利(Pauli)门的方案。本文考虑倒Ψ型五能级冷原子系统,利用奇异微扰展开法推导出三分量耦合非线性薛定谔(nonlinear Schrödinger,NLS)方程。量子态的单个量子比特由NLS方程的精确复合孤子解的分量定义。通过适当的旋转操作,在单个量子比特上实现Pauli-X、Pauli-Y和Pauli-Z操作。进一步以暗-亮-亮型三分量复合孤子作为单个量子比特,分析其自由传播及门操作。结果表明,Pauli-X门可实现分量间交换,Pauli-Y门在分量交换过程中引入相位调制,Pauli-Z门实现相位翻转。本文利用三分量复合孤子叠加态实现三态逻辑操作,为多态量子逻辑门和多通道光信息处理提供了新方案。

Acta Physica Sinica•Sep 4, 2026•0 citations
Conventionally, the quantum oracular algorithms, such as Deutsch-Jozsa, Bernstein-Vazirani, and Grover, utilize Hadamard gates to create uniform superposition states for the input qubits of an oracle. However, Hadamard gates are non-native (non-supported) gates in all real quantum computers. For this reason, Hadamard gates are considered cost-expensive gates when realizing (transpiling) such algorithms into a real quantum computer. This paper introduces a new methodology for cost-effective transpilation of Grover's algorithm into real quantum computers, by replacing all Hadamard gates with X\sqrt {\rm{X}}X​ gates. In quantum computing, the Hadamard and X\sqrt {\rm{X}}X​ gates create uniform superposition states of a qubit on the X-axis and Y-axis of the Bloch sphere, respectively. Hence, we utilize a different axis of the Bloch sphere to construct a cost-effective realization for the final transpiled circuit of Grover's algorithm. Theoretically, the final transpiled circuit of Grover's algorithm using X\sqrt {\rm{X}}X​ gates has been minimized to approximately 64% than the circuit of Grover's algorithm using Hadamard gates. Experimentally, because of the X\sqrt {\rm{X}}X​ is an IBM native gate, it has been proven that the final transpiled circuit of Grover's algorithm using X\sqrt {\rm{X}}X​ gates always has a lower quantum cost of 6% than the circuit of Grover's algorithm using Hadamard gates, due to the limited layout (architecture) connectivity of the physical neighboring qubits for IBM quantum computers.
We present an optical scheme to conditionally generate even or odd squeezed superpositions of coherent states (SSCSs). The optical setup consists of an unbalanced beam splitter whose transmittance tends to unity, and additional balanced beam splitters and photodetectors in auxiliary modes. Squeezed coherent states with different amplitudes are the input states in the optical scheme. The single-qubit operations are probabilistic and employ two- and three-photon subtractions from initial beams as the driving force. Generation of the even or odd SSCSs is observed in a wide diapason of values of used parameters. We consider a possibility to realize a one-way Hadamard gate for the squeezed coherent states when the base states are transformed into superposition states. States approximating the output states of a Hadamard gate with high fidelity can be realized by imposing restrictions on the values of used parameters. Higher-order subtractions from input beams are necessary to generate the SSCSs with larger amplitudes and higher fidelities. The problem is resolved in a Wigner representation to take into account imperfections of the optical devices.
多态量子逻辑门为提高信息编码维度和增强光场调控能力提供了新思路。我们提出通过复合孤子叠加实现三态量子泡利(Pauli)门的方案。本文考虑倒Ψ型五能级冷原子系统,利用奇异微扰展开法推导出三分量耦合非线性薛定谔(nonlinear Schrödinger,NLS)方程。量子态的单个量子比特由NLS方程的精确复合孤子解的分量定义。通过适当的旋转操作,在单个量子比特上实现Pauli-X、Pauli-Y和Pauli-Z操作。进一步以暗-亮-亮型三分量复合孤子作为单个量子比特,分析其自由传播及门操作。结果表明,Pauli-X门可实现分量间交换,Pauli-Y门在分量交换过程中引入相位调制,Pauli-Z门实现相位翻转。本文利用三分量复合孤子叠加态实现三态逻辑操作,为多态量子逻辑门和多通道光信息处理提供了新方案。