Speed improvement of the quantum factorization algorithm of P. Shor by upgrade its classical part by Cherckesova Larissa, Safaryan Olga, Razumov Pavel, Pilipenko Irina, Ivanov Yuriy, Smirnov Ivan

“…Results of calculations of 8 algorithms were considered, among which algorithm with lowest execution rate of task was identified, which allowed the quantum algorithm as whole to work faster, which in turn provides greater potential for practical application of Shor’s quantum algorithm. …”
Get full text

Quantum speedup of branch-and-bound algorithms by Ashley Montanaro

“…Here we describe a quantum algorithm that can accelerate classical branch-and-bound algorithms near-quadratically in a very general setting. …”
Get full text

Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation by Dong An, Di Fang, Lin Lin

“…We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. …”
Get full text

The dihedral hidden subgroup problem by Chen Imin, Sun David

“…The proofs of these no-go results are then adapted to give nontrivial upper bounds on the success probability of a quantum algorithm that uses mm coset samples to solve DCP.…”
Get full text

On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in ℚ(𝜁2𝑠) by Biasse Jean-François, Song Fang

“…We put this attack into perspective by reviewing earlier attempts at providing an efficient quantum algorithm for solving the PIP in ℚ⁢(ζ2s){\mathbb{Q}(\zeta_{2^{s}})}. …”
Get full text

Partial Boolean Functions With Exact Quantum Query Complexity One by Guoliang Xu, Daowen Qiu

“…In addition, we show that the number of all <i>n</i>-bit partial Boolean functions that depend on <i>k</i> bits and can be computed exactly by a 1-query quantum algorithm is not bigger than an upper bound depending on <i>n</i> and <i>k</i>. …”
Get full text

‘Quantum supremacy’ revisited: low-complexity, deterministic solutions of the original Deutsch–Jozsa problem in classical physical systems by Laszlo Bela Kish

“…It is shown that, similarly to the quantum algorithm, the oDJ problem can deterministically be solved with O[log(N)] complexity. …”
Get full text

Quantum Image Processing Algorithm Using Line Detection Mask Based on NEQR by Tao Li, Pengpeng Zhao, Yadong Zhou, Yidai Zhang

“…In this paper, we implement a quantum algorithm based on a line detection mask for novel enhanced quantum representation (NEQR). …”
Get full text

Gravitational wave matched filtering by quantum Monte Carlo integration and quantum amplitude amplification by Koichi Miyamoto, Gonzalo Morrás, Takahiro S. Yamamoto, Sachiko Kuroyanagi, Savvas Nesseris

“…In this paper, we propose a quantum algorithm for matched filtering in gravitational wave (GW) data analysis based on the previous work by Gao et al. …”
Get full text

A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”

Designing excitonic circuits for the Deutsch–Jozsa algorithm: mitigating fidelity loss by merging gate operations by Castellanos, Maria A, Willard, Adam P

“…Here, we consider two different strategies for designing these excitonic circuits for a 2-qubit multi-step quantum algorithm.</p>…”
Get full text

Better-than-classical Grover search via quantum error detection and suppression by Bibek Pokharel, Daniel A. Lidar

“…This constitutes a demonstration of quantum algorithmic breakeven via QED. Along the way, we introduce algorithmic error tomography (AET), a method that provides a holistic view of the errors accumulated throughout an entire quantum algorithm, filtered via the errors detected by the QED code used to encode the circuit. …”
Get full text

Quantum computation for periodic solids in second quantization by Aleksei V. Ivanov, Christoph Sünderhauf, Nicole Holzmann, Tom Ellaby, Rachel N. Kerber, Glenn Jones, Joan Camps

“…In this work, we present a quantum algorithm for ground-state energy calculations of periodic solids on error-corrected quantum computers. …”
Get full text

An efficient high dimensional quantum Schur transform by Hari Krovi

“…Bacon, Chuang and Harrow [5] gave a quantum algorithm for this transform that is polynomial in $n$, $d$ and $\log\epsilon^{-1}$, where $\epsilon$ is the precision. …”
Get full text

The Quantum Binding Problem in the Context of Associative Memory. by Andreas Wichert

“…We present a method to solve the binding problem by using a quantum algorithm for the retrieval of associations from associative memory during visual scene analysis. …”
Get full text

Novel approach to solving stochastic constrained shortest path problem with quantum computing by Yang, Richard Chen Xiao

“…Our findings suggest that the quantum algorithm shows promise in solving this problem faster, and provides reliable results. …”
Get full text

Quantum-enhanced analysis of discrete stochastic processes by Carsten Blank, Daniel K. Park, Francesco Petruccione

“…The quantum algorithm reduces the Monte-Carlo sampling to a Bernoulli trial while taking all stochastic trajectories into account. …”
Get full text

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and \(k\) -mismatch Matching by Jin, Ce, Nogler, Jakob

“…Using a structural result of Charalampopoulos, Kociumaka, and Wellnitz (FOCS 2020), we obtain a quantum algorithm for k-mismatch matching with $k^{3/4} n^{1/2+o(1)}$ query complexity and $\tilde O(kn^{1/2})$ time complexity.…”
Get full text

Generalized quantum PageRank algorithm with arbitrary phase rotations by Sergio A. Ortega, Miguel A. Martin-Delgado

“…Finally, we have studied the stability of the new algorithms. The original quantum algorithm was known to be more stable than the classical. …”
Get full text

Towards Quantum Advantage in Financial Market Risk using Quantum Gradient Algorithms by Nikitas Stamatopoulos, Guglielmo Mazzola, Stefan Woerner, William J. Zeng

“…We introduce a quantum algorithm to compute the market risk of financial derivatives. …”
Get full text