Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Kornerup, Niels"'
We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems -
Externí odkaz:
http://arxiv.org/abs/2401.05321
Autor:
Doty, David, Kornerup, Niels, Luchsinger, Austin, Orshansky, Leo, Soloveichik, David, Woods, Damien
The key factor currently limiting the advancement of computational power of electronic computation is no longer the manufacturing density and speed of components, but rather their high energy consumption. While it has been widely argued that reversib
Externí odkaz:
http://arxiv.org/abs/2309.06957
Autor:
Beame, Paul, Kornerup, Niels
Publikováno v:
LIPIcs 261 (2023) 273-292
Cumulative memory -- the sum of space used per step over the duration of a computation -- is a fine-grained measure of time-space complexity that was introduced to analyze cryptographic applications like password hashing. It is a more accurate cost m
Externí odkaz:
http://arxiv.org/abs/2301.05680
Pebble games are popular models for analyzing time-space trade-offs. In particular, the reversible pebble game is often applied in quantum algorithms like Grover's search to efficiently simulate classical computation on inputs in superposition. Howev
Externí odkaz:
http://arxiv.org/abs/2110.08973
Publikováno v:
Computational Methods in Systems Biology 1 (2018) 256-273
Biological regulatory networks depend upon chemical interactions to process information. Engineering such molecular computing systems is a major challenge for synthetic biology and related fields. The chemical reaction network (CRN) model idealizes c
Externí odkaz:
http://arxiv.org/abs/1907.00053
Autor:
Gunn, Sam, Kornerup, Niels
We looked into the algorithm for calculating Betti numbers presented by Lloyd, Garnerone, and Zanardi (LGZ). We present a new algorithm in the same spirit as LGZ with the intent of clarifying quantum algorithms for computing Betti numbers. Our algori
Externí odkaz:
http://arxiv.org/abs/1906.07673
Pebble games are commonly used to study space-time trade-offs in computation. We present a pebble game that explores this trade-off in quantum simulation of arbitrary classical circuits on non-classical inputs. Many quantum algorithms, such as Shor's
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3ce0daa5d950f88956ff67c200d828b
http://arxiv.org/abs/2110.08973
http://arxiv.org/abs/2110.08973
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.