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

International Journal of Quantum Information

QUANTUM COMPUTATIONAL SCHEMES GENERATED BY k-BOSON ALGEBRAS

Francesco Antonino Raffa, Mario Rasetti

Published Feb 1, 2007• 0 citations
Publisher

Abstract

It is shown that a multiboson (k-boson) algebra can be conveniently utilized to generate a k-dimensional computational basis. The single qukit logical operators are given ∀k and two different constructions of the CNOT gate are presented.
DOI
10.1142/s0219749907002670

Related papers

Multibosons in quantum computation

Francesco Antonino Raffa, Mario Rasetti

The role of the three-boson algebra in the theoretical construction of both logical states and operators for quantum computing is investigated. The computational basis consists of three orthonormal codewords obtained from the coherent states of the algebra. The gate and phase operators acting on the codewords are found, and the relation between their matrix representations in the Fock space and the fundamental representation of su (3) is discussed.

Laser Physics•Sep 28, 2006•2 citations

Universal construction of unitary transformation of quantum computation with one- and two-body interactions

Xijia Miao

Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary representation in usual computational basis. This decomposition may be simplified greatly with the help of the properties of the finite-dimensional multiple-quantum operator algebra spaces of a quantum system and the specific properties of a given quantum algorithm. As elementary building blocks of quantum computation, the two-qubit diagonal gates and one-qubit gates may be constructed physically with one- and two-body interactions in a two-state quantum system and hence could be conveniently realized experimentally. The present work will be helpful for implementing generally any N-qubit quantum computation in those feasible two-state quantum systems and determining conveniently the time evolution of these systems in course of quantum computation.

arXiv:quant-ph/0003068•Mar 17, 2000•6 citations

Minimum Construction of Two-Qubit Quantum Operations

Jun Zhang, Jiří Vala, Shankar Sastry +1 more

Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two applications of the B gate. Realization of the B gate is illustrated with an example of charge-coupled superconducting qubits for which the B gate is seen to be generated in shorter time than the CNOT gate.

arXiv:quant-ph/0312193•Physical Review Letters•Jul 7, 2004•69 citations

Quantum Hamiltonian Computing protocols for molecular electronics Boolean logic gates

Omid Faizy Namarvar, Olivier Giraud, Bertrand Georgeot +1 more

Abstract Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different designs, where the logical outputs are encoded either at fixed energy and spatial positioning of the quantum states, or at different energies. We use these results to construct quantum Boolean adders involving a minimal number of quantum states with the two designs. We also establish a matrix algebra giving an analogy between classical Boolean logic gates and quantum ones, and assess the possibilities of both designs for more complex gates.

arXiv:1812.00395•Quantum Science and Technology•May 23, 2019•10 citations

Quantum circuits of CNOT gates

Marc Bataille

We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give algorithms to optimize this type of circuits in some particular cases. Finally we show how to create some usefull entangled states when a CNOT circuit acts on a fully factorized state.

arXiv:2009.13247•Sep 24, 2020•10 citations

Optimal Model for Fewer-Qubit CNOT Gates With Rydberg Atoms

Rui Li, LI Shu-rui, Dongmin Yu +2 more

Fewer-qubit quantum logic gate, serving as a basic unit for constructing universal multiqubit gates, has been widely applied in quantum computing and quantum information. However, traditional constructions for fewer-qubit gates often utilize a multipulse protocol, which inevitably suffers from serious intrinsic errors during the gate execution. In this paper, we report an optimal model about universal two- and three-qubit cnot gates mediated by excitation to Rydberg states with easily accessible van der Waals interactions. This gate depends on a global optimization to implement amplitude- and phase-modulated pulses via genetic algorithm, which can facilitate the gate operation with fewer optical pulses. Compared to conventional multipulse piecewise schemes, our gate can be realized by simultaneous excitation of atoms to the Rydberg states, saving the time for multipulse switching at different spatial locations. Our numerical simulations show that a single-pulse two- (three-) qubit cnot gate is possibly achieved with a fidelity of 99.23% (90.39%) for two qubits separated by $7.10\phantom{\rule{0.2em}{0ex}}\ensuremath{\mu}\mathrm{m}$ when the fluctuation of Rydberg interactions is excluded. Our work is promising for achieving fast and convenient multiqubit quantum computing in the study of neutral-atom quantum technology.

arXiv:2112.08747•Physical Review Applied•Feb 4, 2022•23 citations
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary representation in usual computational basis. This decomposition may be simplified greatly with the help of the properties of the finite-dimensional multiple-quantum operator algebra spaces of a quantum system and the specific properties of a given quantum algorithm. As elementary building blocks of quantum computation, the two-qubit diagonal gates and one-qubit gates may be constructed physically with one- and two-body interactions in a two-state quantum system and hence could be conveniently realized experimentally. The present work will be helpful for implementing generally any N-qubit quantum computation in those feasible two-state quantum systems and determining conveniently the time evolution of these systems in course of quantum computation.
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two applications of the B gate. Realization of the B gate is illustrated with an example of charge-coupled superconducting qubits for which the B gate is seen to be generated in shorter time than the CNOT gate.
Abstract Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different designs, where the logical outputs are encoded either at fixed energy and spatial positioning of the quantum states, or at different energies. We use these results to construct quantum Boolean adders involving a minimal number of quantum states with the two designs. We also establish a matrix algebra giving an analogy between classical Boolean logic gates and quantum ones, and assess the possibilities of both designs for more complex gates.
Fewer-qubit quantum logic gate, serving as a basic unit for constructing universal multiqubit gates, has been widely applied in quantum computing and quantum information. However, traditional constructions for fewer-qubit gates often utilize a multipulse protocol, which inevitably suffers from serious intrinsic errors during the gate execution. In this paper, we report an optimal model about universal two- and three-qubit cnot gates mediated by excitation to Rydberg states with easily accessible van der Waals interactions. This gate depends on a global optimization to implement amplitude- and phase-modulated pulses via genetic algorithm, which can facilitate the gate operation with fewer optical pulses. Compared to conventional multipulse piecewise schemes, our gate can be realized by simultaneous excitation of atoms to the Rydberg states, saving the time for multipulse switching at different spatial locations. Our numerical simulations show that a single-pulse two- (three-) qubit cnot gate is possibly achieved with a fidelity of 99.23% (90.39%) for two qubits separated by $7.10\phantom{\rule{0.2em}{0ex}}\ensuremath{\mu}\mathrm{m}$ when the fluctuation of Rydberg interactions is excluded. Our work is promising for achieving fast and convenient multiqubit quantum computing in the study of neutral-atom quantum technology.