Folio
Sign inStart free

Folio Search · free preview

Papers on “quantum computing algorithms speedup”

Live results from Semantic Scholar, CrossRef and OpenAlex — no account needed to look.

  1. Parallel Algorithms with Optimal Speedup for Bounded Treewidth

    Hans L. Bodlaender, Torben Hagerup · 1998 · SIAM Journal on Computing · 66 cites

    We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algorithm works in O((log n) 2 ) time using O(n) operations on the EREW PRAM. We also give faster parallel algorithms with optimal speedup for the problem of deciding whether the treewidth of an input graph is bounded by a given constant and for a variety of problems on graphs of bounded treewidth, including all decision problems expressible in monadic second-order logic. On n-vertex input graphs, the algorithms use O(n) operations together with O(log n log

  2. Anticoncentration theorems for schemes showing a quantum speedup

    Dominik Hangleiter, Juan Bermejo-Vega, Martin Schwarz, et al. · 2018 · Quantum · 58 cites

    One of the main milestones in quantum information science is to realise quantum devices that exhibit an exponential computational advantage over classical ones without being universal quantum computers, a state of affairs dubbed quantum speedup, or sometimes "quantum computational supremacy". The known schemes heavily rely on mathematical assumptions that are plausible but unproven, prominently results on anticoncentration of random prescriptions. In this work, we aim at closing the gap by proving two anticoncentration theorems and accompanying hardness results, one for circuit-based schemes, the other for quantum quench-type schemes for quantum simulations. Compared to the few other known s

  3. Enhancing the Performance Prediction of Quantum Computing Algorithms using Gradient Boosting and Ada Boost Regression

    Rajendar Dommeti · 2026 · Journal of Quantum Computing and Advanced Algorithms · 21 cites

    Quantum computing is considered to have tremendous potential to help take the emerging field of "Computational Law" to the next level of growth in terms of the expression and implementation of legal principles. With the promise of quantum technology's increasing influence on the legal industry in mind, this essay utilizes the emerging field of Computational Complexity Theory to explore the types of problems that quantum computing is capable of solving more efficiently than classical computing, which is referred to as Quantum Supremacy. From this foundation, three emerging areas within the legal sector have been identified where quantum computing is likely to show transformative superiority.

  6. Quantum Speedup Based on Classical Decision Trees

    Salman Beigi, Leila Taghavi · 2020 · Quantum · 15 cites

    Lin and Lin \cite{LL16} have recently shown how starting with a classical query algorithm (decision tree) for a function, we may find upper bounds on its quantum query complexity. More precisely, they have shown that given a decision tree for a function f:{0,1}n→[m] whose input can be accessed via queries to its bits, and a guessing algorithm that predicts answers to the queries, there is a quantum query algorithm for f which makes at most O(GT) quantum queries where T is the depth of the decision tree and G is the maximum number of mistakes of the guessing algorithm. In this paper we give a simple proof of and generalize this result for functions f:[ℓ]n→[m] with non-binary input as well as

These are the first 8. There are millions more.

A free account opens every result across all sources — plus saving to your library, one-click citations, and AI synthesis of what you found. The search itself stays free.

See all results free →

Already have an account? Sign in