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

Cambridge University Press eBooks

Quantum bits and quantum gates

Jonathan A. Jones, Dieter Jaksch

Published Jul 19, 2012• 0 citations
Publisher
DOI
10.1017/cbo9781139028509.002

Related papers

Parameterized General Single-bit Quantum Gate Model

Yinghui Gao, Atr Key

Quantum gate networks are the tools to realize the evolution of encoded quantum states,and they are mainly made up of single-bit quantum gates.This paper establishes the parameterized general one-bit quantum gate model based on the unitary quality of the quantum gate,and analyzes the relation between the model and the Bloch Sphere.Through the model parameters setting,the different quantum one-bit gate can be gotten.The proposition of the parameterized general one-bit quantum gate model is very useful to analyze the property of one-bit quantum gate synthetically,and is very helpful to design the practical one-bit quantum gate.

Signal Processing•Jan 1, 2009•0 citations

Quantum Bits and Quantum Registers

Bettina Just

Springer eBooks•Jan 1, 2022•0 citations

CALA-$n$: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts

Ali Al-Bayaty, Xiaoyu Song, Marek A. Perkowski

We introduce a new quantum layout-aware approach to realize cost-effective $n$-bit gates using the Bloch sphere, for $2 \le n \le 5$ qubits. These $n$-bit gates are entirely constructed from the Clifford+T gates, in the approach of selecting sequences of rotations visualized on the Bloch sphere. This Bloch sphere approach ensures to match the quantum layout for synthesizing (transpiling) these $n$-bit gates into an IBM quantum computer. Various standard $n$-bit gates (Toffoli, Fredkin, etc.) and their operational equivalent of our proposed $n$-bit gates are examined and evaluated, in the context of the final quantum costs, as the final counts of generated IBM native gates. In this paper, we demonstrate that all our $n$-bit gates always have lower quantum costs than those of standard $n$-bit gates after transpilation. Hence, our Bloch sphere approach can be used to build a quantum library of various cost-effective $n$-bit gates for different layouts of IBM quantum computers.

arXiv:2408.01025•Aug 2, 2024•14 citations

Quantum Bits and Quantum Information

David S. Simon

Undergraduate texts in physics•Jan 1, 2025•1 citation

Qubits, Quantum Registers, and Quantum Gates

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations

Two-bit Quantum Gates to Implement N-bit Quantum Gates

Zhang Deng

We propose a method for constructing n bit quantum gate (Λ n-1 (W) gate) by using basic 2 bit quantum gates,which is based on Barencos work.This scheme is easier to construct and to implement.

Journal of Optoelectronics·laser•Jan 1, 2001•0 citations
Quantum gate networks are the tools to realize the evolution of encoded quantum states,and they are mainly made up of single-bit quantum gates.This paper establishes the parameterized general one-bit quantum gate model based on the unitary quality of the quantum gate,and analyzes the relation between the model and the Bloch Sphere.Through the model parameters setting,the different quantum one-bit gate can be gotten.The proposition of the parameterized general one-bit quantum gate model is very useful to analyze the property of one-bit quantum gate synthetically,and is very helpful to design the practical one-bit quantum gate.
CALA-nnn: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts
We introduce a new quantum layout-aware approach to realize cost-effective nnn-bit gates using the Bloch sphere, for 2≤n≤52 \le n \le 52≤n≤5 qubits. These nnn-bit gates are entirely constructed from the Clifford+T gates, in the approach of selecting sequences of rotations visualized on the Bloch sphere. This Bloch sphere approach ensures to match the quantum layout for synthesizing (transpiling) these nnn-bit gates into an IBM quantum computer. Various standard nnn-bit gates (Toffoli, Fredkin, etc.) and their operational equivalent of our proposed nnn-bit gates are examined and evaluated, in the context of the final quantum costs, as the final counts of generated IBM native gates. In this paper, we demonstrate that all our nnn-bit gates always have lower quantum costs than those of standard nnn-bit gates after transpilation. Hence, our Bloch sphere approach can be used to build a quantum library of various cost-effective nnn-bit gates for different layouts of IBM quantum computers.