Related papers: Order O(1) algorithm for first-principles transien…
Optimal transportation, or computing the Wasserstein or ``earth mover's'' distance between two distributions, is a fundamental primitive which arises in many learning and statistical settings. We give an algorithm which solves this problem…
Calculating the energy gradient in parameter space has become an almost ubiquitous subroutine of variational near-term quantum algorithms. "Faithful" classical emulation of this subroutine mimics its quantum evaluation, and scales as O(P^2)…
Standard gradient descent methods are susceptible to a range of issues that can impede training, such as high correlations and different scaling in parameter space.These difficulties can be addressed by second-order approaches that apply a…
Based on bottom-up assembly of highly variable neural cells units, the nervous system can reach unequalled level of performances with respect to standard materials and devices used in microelectronic. Reproducing these basic concepts in…
We consider the task of estimating the expectation value of an $n$-qubit tensor product observable $O_1\otimes O_2\otimes \cdots \otimes O_n$ in the output state of a shallow quantum circuit. This task is a cornerstone of variational…
We consider the ``minimum degree spanning tree'' problem. As input, we receive an undirected, connected graph $G=(V, E)$ with $n$ nodes and $m$ edges, and our task is to find a spanning tree $T$ of $G$ that minimizes $\max_{u \in V}…
The most efficient way to calculate strong bisimilarity is by calculation the relational coarsest partition on a transition system. We provide the first linear time algorithm to calculate strong bisimulation using parallel random access…
We present two algorithms for maintaining the topological order of a directed acyclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithms for online topological ordering have many applications,…
Transient simulations of a resonant tunneling diode oscillator are presented. The semiconductor model for the diode consists of a set of time-dependent Schr\"odinger equations coupled to the Poisson equation for the electric potential. The…
Out-of-time-ordered correlators (OTOC) are a quantifier of quantum information scrambling and quantum chaos. We propose an efficient quantum algorithm to measure OTOCs that provides an exponential speed-up over the best known classical…
Efficient computation of the optimal transport distance between two distributions serves as an algorithm subroutine that empowers various applications. This paper develops a scalable first-order optimization-based method that computes…
Bu{\ss} et al [KDD 2020] recently proved that the problem of computing the betweenness of all nodes of a temporal graph is computationally hard in the case of foremost and fastest paths, while it is solvable in time O(n 3 T 2 ) in the case…
The fast marching algorithm computes an approximate solution to the eikonal equation in O(N log N) time, where the factor log N is due to the administration of a priority queue. Recently, Yatziv, Bartesaghi and Sapiro have suggested to use…
In the article ''On the (Non) NP-Hardness of Computing Circuit Complexity'', Murray and Williams imply the PARTITION decision problem is not known to be NP-hard via $2^{n^{o(1)}}$-size AC0 reductions. In this note, we show PARTITION is…
We present a quantum algorithm for simulating quantum chemistry with gate complexity $\tilde{O}(N^{1/3} \eta^{8/3})$ where $\eta$ is the number of electrons and $N$ is the number of plane wave orbitals. In comparison, the most efficient…
Tensor Attention, a multi-view attention that is able to capture high-order correlations among multiple modalities, can overcome the representational limitations of classical matrix attention. However, the $O(n^3)$ time complexity of tensor…
Nano-constriction based spin Hall nano-oscillators (SHNOs) are at the forefront of spintronics research for emerging technological applications such as oscillator-based neuromorphic computing and Ising Machines. However, their…
In this paper we study flow problems on temporal networks, where edge capacities and travel times change over time. We consider a network with $n$ nodes and $m$ edges where the capacity and length of each edge is a piecewise constant…
An algorithm for first-principles electronic structure calculations having a computational cost which scales linearly with the system size is presented. Our method exploits the real-space localization of the density matrix, and in this…
We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes…