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

SN Applied Sciences

Feasible computation based on quantum logic

Kenji Tokuo

Published Sep 21, 2019• 1 citation
Publisher
DOI
10.1007/s42452-019-1193-x

Related papers

Multivalued logic gates for quantum computation

Ashok Muthukrishnan, Carlos R. Stroud

We develop a multivalued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems $(d>2)$ can be decomposed into logic gates that operate on only two systems at a time. We show that such multivalued logic gates are experimentally feasible in the context of the linear ion trap scheme for quantum computing. By using d levels in each ion in this scheme, we reduce the number of ions needed for a computation by a factor of ${\mathrm{log}}_{2}d.$

arXiv:quant-ph/0002033•Physical Review A•Oct 16, 2000•411 citations

Quantum computational logic

M. Dalla Chiara, Roberto Giuntini, Richard J. Greechie

Trends in logic•Jan 1, 2004•3 citations

Quantum Computational Logic

Stanley Gudder

International Journal of Theoretical Physics•Jan 1, 2003•75 citations

A Feasible Design of Elementary Quantum Arithmetic Logic Units for Near-Term Quantum Computers

Junxu Li

Quantum arithmetic logic units (QALUs) constitute a fundamental component of quantum computing. However, the implementation of QALUs on near-term quantum computers remains a substantial challenge, largely due to the limited connectivity of qubits. In this paper, we propose feasible QALUs, including quantum binary adders, subtractors, multipliers, and dividers, which are designed for near-term quantum computers with qubits arranged in two-dimensional arrays. Additionally, we introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. The proposed QALUs utilize only Pauli-X gates, CNOT gates, and $C\sqrt{X}$ (CSX) gates, and all two-qubit gates are operated between nearest neighbor qubits. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.

arXiv:2408.06561•Aug 13, 2024•2 citations

Two qubits in pure nuclear quadrupole resonance

G. B. Furman, S. D. Goren, V. Meerovich +1 more

It is shown theoretically that by the use of two radio-frequency fields of the same resonance frequency but with the different phases and directions the degeneracy of the energy spectrum of a spin system with I = 3/2 is removed. This leads to four non-degenerate spin states which can be used as a platform for quantum computing. The feasibility of quantum computing based on a pure (without DC magnetic fields) nuclear quadrupole resonance technique is investigated in detail. Various quantum logic gates can be constructed by using different excitation techniques allowing different manipulations with the spin system states. Three realizations of quantum logic gates are considered: the application of an additional magnetic field with the resonance frequency, the amplitude modulation of one of the applied RF fields by the resonance frequency field, and the level-crossing method. It is shown that the probabilities of the resonance transitions depend on the method of excitation and on the direction of the excitation field. Feasibility of quantum computing is demonstrated with the examples of constructing a controlled-NOT logic gate using the resonance excitation technique and SWAP and NOT2 logic gates using the level-crossing method.

Journal of Physics Condensed Matter•Sep 5, 2002•12 citations

Towards Quantum Computational Logics

Antonio Ledda, Giuseppe Sergioli

International Journal of Theoretical Physics•May 25, 2010•11 citations
We develop a multivalued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems (d>2)(d>2)(d>2) can be decomposed into logic gates that operate on only two systems at a time. We show that such multivalued logic gates are experimentally feasible in the context of the linear ion trap scheme for quantum computing. By using d levels in each ion in this scheme, we reduce the number of ions needed for a computation by a factor of log2d.{\mathrm{log}}_{2}d.log2​d.
Quantum arithmetic logic units (QALUs) constitute a fundamental component of quantum computing. However, the implementation of QALUs on near-term quantum computers remains a substantial challenge, largely due to the limited connectivity of qubits. In this paper, we propose feasible QALUs, including quantum binary adders, subtractors, multipliers, and dividers, which are designed for near-term quantum computers with qubits arranged in two-dimensional arrays. Additionally, we introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. The proposed QALUs utilize only Pauli-X gates, CNOT gates, and CXC\sqrt{X}CX​ (CSX) gates, and all two-qubit gates are operated between nearest neighbor qubits. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.
It is shown theoretically that by the use of two radio-frequency fields of the same resonance frequency but with the different phases and directions the degeneracy of the energy spectrum of a spin system with I = 3/2 is removed. This leads to four non-degenerate spin states which can be used as a platform for quantum computing. The feasibility of quantum computing based on a pure (without DC magnetic fields) nuclear quadrupole resonance technique is investigated in detail. Various quantum logic gates can be constructed by using different excitation techniques allowing different manipulations with the spin system states. Three realizations of quantum logic gates are considered: the application of an additional magnetic field with the resonance frequency, the amplitude modulation of one of the applied RF fields by the resonance frequency field, and the level-crossing method. It is shown that the probabilities of the resonance transitions depend on the method of excitation and on the direction of the excitation field. Feasibility of quantum computing is demonstrated with the examples of constructing a controlled-NOT logic gate using the resonance excitation technique and SWAP and NOT2 logic gates using the level-crossing method.