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

Bulletin of the American Physical Society

Entangling quantum gates using extended Hilbert space

Dmitry Solenov

Published Mar 3, 2015• 0 citations
OpenAlex

Related papers

Quantum-gate characterization in an extended Hilbert space (5 pages)

Peter P. Rohde, Geoff J. Pryde, J. L. O Brien

Physical Review A•Jan 1, 2005•0 citations

Quantum gates and entanglement

Schmidt-Kaler, Haffiier, Riebe +7 more

Conference on Lasers and Electro-Optics•Jan 1, 2004•0 citations

Quantum algorithms on a four-qubit photonic controlled-shift gate

Joseph Ho, Raj B. Patel, Timothy C. Ralph +1 more

We implement a four-qubit controlled-shift gate leveraging photon entanglement in extended Hilbert spaces and observe Psuccess = 0.25. This enables our demonstration of a DQC1 protocol and the quantum phase estimation algorithm featuring a multi-qubit unitary.

Quantum Information and Measurement (QIM)•Jan 1, 2019•0 citations

Genuine entanglement and LU-equivalence of graph states in bipartition

Yuting Huang, Lin Chen

Graph states are intuitive representations of quantum states that are useful in quantum computing and quantum information. In this paper, we investigate the role of entanglement and local unitary equivalence in quantum computing through graph states in high-dimensional Hilbert spaces. We introduce bipartitions on the vertices sets and demonstrate separability and local unitary equivalence based on different choices of partitions. By performing the two-qubit controlled phase shift gates on various pairs of multiqubit system, one can generate a genuinely entangled graph state based on simple connected graphs. We extend 2-dimensional Hilbert spaces to higher and mixed dimensions and examine pure quantum states that cannot be separated by any bipartition. In addition, we generalize the analysis on classification of local unitary equivalence beyond the controlled-Z gates to controlled phase gates. By examining graphs constructed from bipartition graphs, we have shown that graphs with identical bipartition subgraph structures are local unitary equivalent.

Modern Physics Letters A•Dec 10, 2025•0 citations

Elementary quantum gates in different bases

Sergey A. Podoshvedov

arXiv:1604.00325•Quantum Information Processing•Jul 2, 2016•16 citations

Quantum gates and quantum circuits

Anirban Pathak

CRC Press eBooks•Jun 20, 2013•0 citations
Graph states are intuitive representations of quantum states that are useful in quantum computing and quantum information. In this paper, we investigate the role of entanglement and local unitary equivalence in quantum computing through graph states in high-dimensional Hilbert spaces. We introduce bipartitions on the vertices sets and demonstrate separability and local unitary equivalence based on different choices of partitions. By performing the two-qubit controlled phase shift gates on various pairs of multiqubit system, one can generate a genuinely entangled graph state based on simple connected graphs. We extend 2-dimensional Hilbert spaces to higher and mixed dimensions and examine pure quantum states that cannot be separated by any bipartition. In addition, we generalize the analysis on classification of local unitary equivalence beyond the controlled-Z gates to controlled phase gates. By examining graphs constructed from bipartition graphs, we have shown that graphs with identical bipartition subgraph structures are local unitary equivalent.