Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Fast quantum search algorithm for databases of arbitrary size and its implementation in a cavity QED system

From MaRDI portal
Publication:1928040
Jump to:navigation, search

DOI10.1016/j.physleta.2011.10.016zbMath1254.81027OpenAlexW2074373974MaRDI QIDQ1928040

Yanyan Li

Publication date: 2 January 2013

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physleta.2011.10.016


zbMATH Keywords

cavity QEDquantum computationGrover algorithmqudit


Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Quantum optics (81V80) Quantum algorithms and complexity in the theory of computing (68Q12)


Related Items

Generating three-dimensional entanglement for atomic ensembles trapped in two separated cavity via an optical fiber ⋮ Efficient entanglement concentration for arbitrary less-entangled \(N\)-atom GHZ state



Cites Work

  • Simple algorithm for partial quantum search
  • Optimization of partial search
  • Adiabatic elimination in a lambda system
  • Fixed-Point Quantum Search
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1928040&oldid=14355526"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki