Quantum Computation and Applications

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Analysis of Algorithms and Complexity Theory".

Deadline for manuscript submissions: closed (31 December 2020) | Viewed by 3067

Special Issue Editors


E-Mail Website
Guest Editor
College of Information Science and Engineering, Ritsumeikan University
Interests: computer science

E-Mail Website
Guest Editor
Graduate School of Mathematics, Nagoya University
Interests: computer science

E-Mail Website
Guest Editor
IBM Research -- Tokyo
Interests: computer science

Special Issue Information

Dear Colleagues,

We invite you to submit your latest research in the area of quantum computation. We are looking for new and innovative algorithmic approaches for all aspects of quantum computation. High-quality papers are solicited to address both theoretical and practical issues of quantum computation. Potential topics include but are not limited to analyzing and/or verifing the power of quantum computation and communication, new quantum algorithms, new applications of quantum computation and communication, efficient design methodology for quantum computation, etc.  

Prof. Shigeru Yamashita
Prof. François Le Gall
Dr. Rudy Raymond
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Quantum complexity theory
  • Quantum communication complexity
  • Models of quantum computation
  • Design and analysis of quantum algorithms
  • Emerging trends in quantum algorithms
  • Quantum algorithms for machine learning tasks
  • Quantum-inspired classical algorithms
  • Fault-tolerant quantum computation
  • Design methodologies for quantum circuits
  • New tools to design/build/optimize/debug quantum hardware devices and quantum software
  • Emerging applications of noisy quantum devices
  • Variational quantum algorithms
  • Learning and optimization with hybrid quantum-classical methods
  • Quantum machine learning applications
  • Quantum simulation
  • Quantum error mitigation

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

14 pages, 994 KiB  
Article
Searching via Nonlinear Quantum Walk on the 2D-Grid
by Giuseppe Di Molfetta and Basile Herzog
Algorithms 2020, 13(11), 305; https://doi.org/10.3390/a13110305 - 23 Nov 2020
Cited by 3 | Viewed by 2319
Abstract
We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational advantage with respect to the classical algorithms. [...] Read more.
We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational advantage with respect to the classical algorithms. For this purpose, we have considered the free lattice Hamiltonian, with linear dispersion relation introduced by Childs and Ge The numerical simulations showed that the walker finds the marked vertex in O(N1/4log3/4N) steps, with probability O(1/logN), for an overall complexity of O(N1/4log5/4N), using amplitude amplification. We also proved that there exists an optimal choice of the walker parameters to avoid the time measurement precision affecting the complexity searching time of the algorithm. Full article
(This article belongs to the Special Issue Quantum Computation and Applications)
Show Figures

Figure 1

Back to TopTop