Matches in SemOpenAlex for { <https://semopenalex.org/work/W4308608908> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W4308608908 abstract "We show that the algorithmic complexity of any classical algorithm written in a Turing-complete programming language polynomially bounds the number of quantum bits that are required to run and even symbolically execute the algorithm on a quantum computer. In particular, we show that any classical algorithm $A$ that runs in $mathcal{O}(f(n))$ time and $mathcal{O}(g(n))$ space requires no more than $mathcal{O}(f(n)cdot g(n))$ quantum bits to execute, even symbolically, on a quantum computer. With $mathcal{O}(1)leqmathcal{O}(g(n))leqmathcal{O}(f(n))$ for all $n$, the quantum bits required to execute $A$ may therefore not exceed $mathcal{O}(f(n)^2)$ and may come down to $mathcal{O}(f(n))$ if memory consumption by $A$ is bounded by a constant. Our construction works by encoding symbolic execution of machine code in a finite state machine over the satisfiability-modulo-theory (SMT) of bitvectors, for modeling CPU registers, and arrays of bitvectors, for modeling main memory. The FSM is linear in the size of the code, independent of execution time and space, and represents the reachable machine states for any given input. The FSM may be explored by bounded model checkers using SMT and SAT solvers as backend. However, for the purpose of this paper, we focus on quantum computing by unrolling and bit-blasting the FSM into (1)~satisfiability-preserving quadratic unconstrained binary optimization (QUBO) models targeting adiabatic forms of quantum computing such as quantum annealing, and (2)~semantics-preserving quantum circuits (QCs) targeting gate-model quantum computers. With our compact QUBOs, real quantum annealers can now execute simple but real code even symbolically, yet only with potential but no guarantee for exponential speedup, and with our QCs as oracles, Grover's algorithm applies to symbolic execution of arbitrary code, guaranteeing at least in theory a quadratic speedup." @default.
- W4308608908 created "2022-11-13" @default.
- W4308608908 creator A5044364762 @default.
- W4308608908 creator A5081572933 @default.
- W4308608908 date "2021-11-23" @default.
- W4308608908 modified "2023-09-27" @default.
- W4308608908 title "Quantum Advantage for All" @default.
- W4308608908 doi "https://doi.org/10.48550/arxiv.2111.12063" @default.
- W4308608908 hasPublicationYear "2021" @default.
- W4308608908 type Work @default.
- W4308608908 citedByCount "0" @default.
- W4308608908 crossrefType "posted-content" @default.
- W4308608908 hasAuthorship W4308608908A5044364762 @default.
- W4308608908 hasAuthorship W4308608908A5081572933 @default.
- W4308608908 hasBestOaLocation W43086089081 @default.
- W4308608908 hasConcept C11413529 @default.
- W4308608908 hasConcept C118615104 @default.
- W4308608908 hasConcept C121332964 @default.
- W4308608908 hasConcept C134306372 @default.
- W4308608908 hasConcept C137019171 @default.
- W4308608908 hasConcept C192061203 @default.
- W4308608908 hasConcept C33923547 @default.
- W4308608908 hasConcept C34388435 @default.
- W4308608908 hasConcept C41008148 @default.
- W4308608908 hasConcept C51003876 @default.
- W4308608908 hasConcept C58053490 @default.
- W4308608908 hasConcept C62520636 @default.
- W4308608908 hasConcept C84114770 @default.
- W4308608908 hasConcept C90408235 @default.
- W4308608908 hasConceptScore W4308608908C11413529 @default.
- W4308608908 hasConceptScore W4308608908C118615104 @default.
- W4308608908 hasConceptScore W4308608908C121332964 @default.
- W4308608908 hasConceptScore W4308608908C134306372 @default.
- W4308608908 hasConceptScore W4308608908C137019171 @default.
- W4308608908 hasConceptScore W4308608908C192061203 @default.
- W4308608908 hasConceptScore W4308608908C33923547 @default.
- W4308608908 hasConceptScore W4308608908C34388435 @default.
- W4308608908 hasConceptScore W4308608908C41008148 @default.
- W4308608908 hasConceptScore W4308608908C51003876 @default.
- W4308608908 hasConceptScore W4308608908C58053490 @default.
- W4308608908 hasConceptScore W4308608908C62520636 @default.
- W4308608908 hasConceptScore W4308608908C84114770 @default.
- W4308608908 hasConceptScore W4308608908C90408235 @default.
- W4308608908 hasLocation W43086089081 @default.
- W4308608908 hasOpenAccess W4308608908 @default.
- W4308608908 hasPrimaryLocation W43086089081 @default.
- W4308608908 hasRelatedWork W2901445955 @default.
- W4308608908 hasRelatedWork W2963768709 @default.
- W4308608908 hasRelatedWork W3044874919 @default.
- W4308608908 hasRelatedWork W4200630323 @default.
- W4308608908 hasRelatedWork W4289293126 @default.
- W4308608908 hasRelatedWork W4293103067 @default.
- W4308608908 hasRelatedWork W4353115123 @default.
- W4308608908 hasRelatedWork W4362706727 @default.
- W4308608908 hasRelatedWork W4384648086 @default.
- W4308608908 hasRelatedWork W4225980927 @default.
- W4308608908 isParatext "false" @default.
- W4308608908 isRetracted "false" @default.
- W4308608908 workType "article" @default.