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

Physics Today

Frog eyes show prowess as quantum sensors

Ashley G. Smart

Published Jul 1, 2014• 0 citations
Publisher
DOI
10.1063/pt.3.2437

Related papers

The Human Eye Could Help Test Quantum Mechanics

Anil Ananthaswamy

Scientific American•Dec 1, 2018•0 citations

Frog eyes show prowess as quantum detectors

Ashley G. Smart

Nearly one out of every three photons that reach the frog's photoreceptor cells elicits a neuronal spike. Nearly one out of every three photons that reach the frog's photoreceptor cells elicits a neuronal spike.

Physics Today•May 29, 2014•0 citations

Quantum sensing goes bio

Sadra Bakhshandeh

Nature Reviews Materials•Mar 22, 2022•12 citations

Improved Shuffled Frog Leaping Algorithm Based on Quantum Rotation Gates

Guo Liang Wu, Liguo Fang, Jian-jun LI +1 more

Aiming at the search speed and accuracy of the shuffled frog leaping algorithm not high, the idea of variation was integrated into the shuffled frog leaping algorithm. A new improved shuffled frog leaping algorithm was proposed which was called quantum frog leaping algorithm. The positions of frog are encoded by the probability amplitudes of quantum bits, the movements of frog are performed by quantum rotation gates, which achieve particles searching. Through the experiments on six standard functions, simulation results show the proposed algorithm has high searching efficiency and precision, Moreover, QSFLA as a promising optimization algorithm has strong convergence and high stability.

DEStech Transactions on Computer Science and Engineering•Oct 10, 2017•0 citations

Quantum Optical Sensors

Daniel F. Walls, Gerard J Milburn

Graduate texts in physics•Jan 1, 2025•0 citations

Quantum Binary Shuffled Frog Leaping Algorithm

Lianguo Wang, Yaxing Gong

A quantum binary shuffled frog leaping algorithm (QBSFLA) is proposed through integrating the theories of the quantum evolutionary algorithm and the shuffled frog leaping algorithm (SFLA). Firstly, the superposition state characteristic of quantum makes the separate individual expresses more states, and the probability expression characteristic makes individuals' states are expressed with certain probability for increasing the diversity of the population potentially. Then, SFLA is used to regulate the phrase of the quantum bit to achieve a balance of the local and global search and improve the run speed. The experi-mental results of three 0-1 knapsack problems solved by QBSFLA with the greedy algorithm show that QBSFLA has several advantages such as fast convergence, powerful global search ability and good stability.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Sep 1, 2013•7 citations
Aiming at the search speed and accuracy of the shuffled frog leaping algorithm not high, the idea of variation was integrated into the shuffled frog leaping algorithm. A new improved shuffled frog leaping algorithm was proposed which was called quantum frog leaping algorithm. The positions of frog are encoded by the probability amplitudes of quantum bits, the movements of frog are performed by quantum rotation gates, which achieve particles searching. Through the experiments on six standard functions, simulation results show the proposed algorithm has high searching efficiency and precision, Moreover, QSFLA as a promising optimization algorithm has strong convergence and high stability.
A quantum binary shuffled frog leaping algorithm (QBSFLA) is proposed through integrating the theories of the quantum evolutionary algorithm and the shuffled frog leaping algorithm (SFLA). Firstly, the superposition state characteristic of quantum makes the separate individual expresses more states, and the probability expression characteristic makes individuals' states are expressed with certain probability for increasing the diversity of the population potentially. Then, SFLA is used to regulate the phrase of the quantum bit to achieve a balance of the local and global search and improve the run speed. The experi-mental results of three 0-1 knapsack problems solved by QBSFLA with the greedy algorithm show that QBSFLA has several advantages such as fast convergence, powerful global search ability and good stability.