Related papers: (No) Quantum space-time tradeoff for USTCON
Non-Abelian topological order (TO) enables topologically protected quantum computation with its anyonic quasiparticles. Recently, TO with $S_3$ gauge symmetry was identified as a sweet spot -- simple enough to emerge from finite-depth…
We study variable time search, a form of quantum search where queries to different items take different time. Our first result is a new quantum algorithm that performs variable time search with complexity $O(\sqrt{T}\log n)$ where…
A quantum clock must satisfy two basic constraints. The first is a bound on the time resolution of the clock given by the difference between its maximum and minimum energy eigenvalues. The second follows from Holevo's bound on how much…
Time ordering may be defined by first defining the limit of no time ordering (NTO) in terms of a time average of an external interaction, V(t). Previously, time correlation was defined in terms of a similar limit called the independent time…
Given a 2-edge connected, unweighted, and undirected graph $G$ with $n$ vertices and $m$ edges, a $\sigma$-tree spanner is a spanning tree $T$ of $G$ in which the ratio between the distance in $T$ of any pair of vertices and the…
It has been recently suggested that in wireless networks, CSMA-based distributed MAC algorithms could achieve optimal utility without any message passing. We present the first proof of convergence of such adaptive CSMA algorithms towards an…
Performance of cryptanalytic quantum search algorithms is mainly inferred from query complexity which hides overhead induced by an implementation. To shed light on quantitative complexity analysis removing hidden factors, we provide a…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
Let $G = (V, E)$ be an undirected graph with $n$ vertices and $m$ edges, and let $\mu = m/n$. A \emph{distance oracle} is a data structure designed to answer approximate distance queries, with the goal of achieving low stretch, efficient…
Using a neutron double-slit setup, we construct a quantum bit commitment scheme in which time development of quantum states plays an essential role. Our scheme evades the widely accepted no-go theorem by the fact that it is neither possible…
We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion actuators. Those robots must collaborate to reach a sin- gle vertex that is unknown beforehand, and…
Nonlinear stochastic differential equations (NSDEs) are a pillar of mathematical modeling for scientific and engineering applications. Accurate and efficient simulation of large-scale NSDEs is prohibitive on classical computers due to the…
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a ``semi-duality'' between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling…
While it has been widely recognized that genuine quantum advantage for practical problems might only be achieved with fault-tolerant quantum computers, it is still not entirely clear whether the required quantum error correction will be…
The Maximum Matching problem has a quantum query complexity lower bound of $\Omega(n^{3/2})$ for graphs on $n$ vertices represented by an adjacency matrix. The current best quantum algorithm has the query complexity $O(n^{7/4})$, which is…
Previous demonstrations of free-space quantum communication in daylight have been touted as significant for the development of global-scale quantum networks. Until now, no one has carefully tuned their atmospheric channel to reproduce the…
A quantum time topological space is developed and applied to solve some problems about quantum theory. It is disconnected and satifies specific separation axioms. The degree of disconnectedness of the time-space is a decreasing function of…
We analyze a class of distributed quantized consen- sus algorithms for arbitrary networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and…
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work,…
Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancillary clock register tracking the progress of the computation.…