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

Springer eBooks

The Gifts of Quantum Physics

Amit Goswami

Published Jan 1, 2001• 0 citations
Publisher
DOI
10.1007/978-1-4615-0527-3_22

Related papers

THE MIRACLES OF QUANTUM MECHANICS

WORLD SCIENTIFIC eBooks•Sep 21, 2022•0 citations

Efficient Implementation of PRESENT and GIFT on Quantum Computers

Kyungbae Jang, Gyeongju Song, Hyunjun Kim +3 more

Grover search algorithm is the most representative quantum attack method that threatens the security of symmetric key cryptography. If the Grover search algorithm is applied to symmetric key cryptography, the security level of target symmetric key cryptography can be lowered from n-bit to n2-bit. When applying Grover’s search algorithm to the block cipher that is the target of potential quantum attacks, the target block cipher must be implemented as quantum circuits. Starting with the AES block cipher, a number of works have been conducted to optimize and implement target block ciphers into quantum circuits. Recently, many studies have been published to implement lightweight block ciphers as quantum circuits. In this paper, we present optimal quantum circuit designs of symmetric key cryptography, including PRESENT and GIFT block ciphers. The proposed method optimized PRESENT and GIFT block ciphers by minimizing qubits, quantum gates, and circuit depth. We compare proposed PRESENT and GIFT quantum circuits with other results of lightweight block cipher implementations in quantum circuits. Finally, quantum resources of PRESENT and GIFT block ciphers required for the oracle of the Grover search algorithm were estimated.

Applied Sciences•May 23, 2021•60 citations

The Crisis in Quantum Physics

Benjamin Z. Gal-Or

Springer eBooks•Jan 1, 1987•0 citations

Qubits Underlie Gifted Savants

John Robert Burger

Qubits restricted to spin up or spin down may be realized with neurons to explain the gifted behaviors of savants. This paper synthesizes qubit systems that are electrically and procedurally reversible, and that support quick learning, or memorization and calculational achievement as demonstrated by gifted savants.

NeuroQuantology•Feb 17, 2011•2 citations

Quantum Physics: What and Why

Dick Kovar, Sean J. O'Reilly, William V. Medlin

Science News•Feb 22, 1986•0 citations

Understanding quantum phenomena without solving the Schrödinger equation: the case of the finite square well

Victor Bârsan

An approximate formula for the energy levels of the bound states of a particle in a finite square well are obtained, without using the Schrodinger equation. The physics and mathematics involved in this approach are accessible to a gifted high school student.

European Journal of Physics•Aug 28, 2015•4 citations
Grover search algorithm is the most representative quantum attack method that threatens the security of symmetric key cryptography. If the Grover search algorithm is applied to symmetric key cryptography, the security level of target symmetric key cryptography can be lowered from n-bit to n2-bit. When applying Grover’s search algorithm to the block cipher that is the target of potential quantum attacks, the target block cipher must be implemented as quantum circuits. Starting with the AES block cipher, a number of works have been conducted to optimize and implement target block ciphers into quantum circuits. Recently, many studies have been published to implement lightweight block ciphers as quantum circuits. In this paper, we present optimal quantum circuit designs of symmetric key cryptography, including PRESENT and GIFT block ciphers. The proposed method optimized PRESENT and GIFT block ciphers by minimizing qubits, quantum gates, and circuit depth. We compare proposed PRESENT and GIFT quantum circuits with other results of lightweight block cipher implementations in quantum circuits. Finally, quantum resources of PRESENT and GIFT block ciphers required for the oracle of the Grover search algorithm were estimated.