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

Optics and Photonics News

Scalable Quantum Computing with Linear Optics and Quantum Memories

Zhen-Sheng Yuan, Yu-Ao Chen, Shuai Chen, Jian-Wei Pan

Published Nov 1, 2007• 0 citations
Publisher

Abstract

Quantum computing is a powerful application of the laws of quantum physics. It may one day be far more efficient than conventional computation methods at factoring large integers, performing database searches and making quantum physics simulations.
DOI
10.1364/opn.18.11.000024

Related papers

Scalable Quantum Computing with Linear Optics and Quantum Memories

Zhen-Sheng Yuan, Yu-Ao Chen, Shuai Chen +1 more

Quantum computing is a powerful application of the laws of quantum physics. It may one day be far more efficient than conventional computation methods at factoring large integers, performing database searches and making quantum physics simulations.

Optics and Photonics News•Nov 1, 2007•0 citations

Comparison of container-based platforms for quantum computing simulation

Ginés Carrascal, Guillermo Botella, Alberto Antonio Del Barrio

Quantum Computing allows for substantial speed-ups e.g. for integer factorization or database search, compared to conventional computation. However, since real quantum computers are an emerging technology, a significant amount of research in this domain still relies on simulations of quantum computations on conventional machines. This paper proposes a containerized environment to simulate quantum circuits, making this environment quick and easy to share within research teams. Also test the environment implementing an arithmetic circuit (Vedral’s adder) and compares the performance of two of the current more used environments: IBM QISKit and Google Cirq.

•Jan 1, 2020•0 citations

Q#

Krysta Svore, Alan Geller, Matthias Troyer +7 more

Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available to traditional computing. It offers the potential of significant computational speed-ups in quantum chemistry, materials science, cryptography, and machine learning.

arXiv:1803.00652•Feb 24, 2018•287 citations

Quantum Search in Hilbert Space

Michail A. Zak

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

•Jan 1, 2003•0 citations

Exploring the Current State of Quantum Computing

David Alan Grier

Quantum computing promises to help us someday reach impressive computing speed. Explains briefly what quantum computing is and discusses future applications for its use.

Computer•Jun 1, 2019•1 citation

Implementation and analysis of quantum computing application to Higgs boson reconstruction at the large Hadron Collider

Anthony Alexiades Armenakas, Oliver Keith Baker

With the advent of the High-Luminosity Large Hadron Collider (HL-LHC) era, high energy physics (HEP) event selection will require new approaches to rapidly and accurately analyze vast databases. The current study addresses the enormity of HEP databases in an unprecedented manner-a quantum search using Grover's Algorithm (GA) on an unsorted database, ATLAS Open Data, from the ATLAS detector. A novel method to identify rare events at 13 TeV in CERN's LHC using quantum computing (QC) is presented. As indicated by the Higgs boson decay channel [Formula: see text], the detection of four leptons in one event may be used to reconstruct the Higgs boson and, more importantly, evince Higgs boson decay to some new phenomena, such as [Formula: see text]. Searching the dataset for collisions resulting in detection of four leptons using a Jupyter Notebook, a classical simulation of GA, and several quantum computers with multiple qubits, the current application was found to make the proper selection in the unsorted dataset. Quantum search efficacy was analyzed for the incoming HL-LHC by implementing the QC method on multiple classical simulators and IBM's quantum computers with the IBM Qiskit Open Source Software. The current QC application provides a novel, high-efficiency alternative to classical database searches, demonstrating its potential utility as a rapid and increasingly accurate search method in HEP.

Scientific Reports•Nov 24, 2021•1 citation
Quantum Computing allows for substantial speed-ups e.g. for integer factorization or database search, compared to conventional computation. However, since real quantum computers are an emerging technology, a significant amount of research in this domain still relies on simulations of quantum computations on conventional machines. This paper proposes a containerized environment to simulate quantum circuits, making this environment quick and easy to share within research teams. Also test the environment implementing an arithmetic circuit (Vedral’s adder) and compares the performance of two of the current more used environments: IBM QISKit and Google Cirq.
A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.
With the advent of the High-Luminosity Large Hadron Collider (HL-LHC) era, high energy physics (HEP) event selection will require new approaches to rapidly and accurately analyze vast databases. The current study addresses the enormity of HEP databases in an unprecedented manner-a quantum search using Grover's Algorithm (GA) on an unsorted database, ATLAS Open Data, from the ATLAS detector. A novel method to identify rare events at 13 TeV in CERN's LHC using quantum computing (QC) is presented. As indicated by the Higgs boson decay channel [Formula: see text], the detection of four leptons in one event may be used to reconstruct the Higgs boson and, more importantly, evince Higgs boson decay to some new phenomena, such as [Formula: see text]. Searching the dataset for collisions resulting in detection of four leptons using a Jupyter Notebook, a classical simulation of GA, and several quantum computers with multiple qubits, the current application was found to make the proper selection in the unsorted dataset. Quantum search efficacy was analyzed for the incoming HL-LHC by implementing the QC method on multiple classical simulators and IBM's quantum computers with the IBM Qiskit Open Source Software. The current QC application provides a novel, high-efficiency alternative to classical database searches, demonstrating its potential utility as a rapid and increasingly accurate search method in HEP.