Related papers: Dividing and Conquering the Van Vleck Catastrophe
We study the question of when investing additional quantum resources in preparing a ground state will improve the aggregate runtime associated with estimating its energy. We analyze Lin and Tong's near-optimal state preparation algorithm…
One of the main applications of future quantum computers will be the simulation of quantum models. While the evolution of a quantum state under a Hamiltonian is straightforward (if sometimes expensive), using quantum computers to determine…
In the Noisy Intermediate-Scale Quantum (NISQ) era, solving the electronic structure problem from chemistry is considered as the "killer application" for near-term quantum devices. In spite of the success of variational hybrid…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems. In particular, we examine the computation of the cumulative distribution function (CDF) of the spectral measure…
Graph partitioning schedules parallel calculations like sparse matrix-vector multiply (SpMV). We consider contiguous partitions, where the $m$ rows (or columns) of a sparse matrix with $N$ nonzeros are split into $K$ parts without…
The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…
The ability of near-term quantum computers to represent classically-intractable quantum states has brought much interest in using such devices for estimating the ground and excited state energies of fermionic Hamiltonians. The usefulness of…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
Divide and Conquer (DC) is conceptually well suited to high-dimensional optimization by decomposing a problem into multiple small-scale sub-problems. However, appealing performance can be seldom observed when the sub-problems are…
An extension to computational mechanics complexity measure is proposed in order to tackle quantum states complexity quantification. The method is applicable to any $n-$partite state of qudits through some simple modifications. A Werner…
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…
The analysis of a chemical reaction along the ground state potential energy surface in conjunction with an unknown spin state is challenging because electronic states must be separately computed several times using different spin…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
Recent progress in quantum computing is paving the way for the realization of early fault-tolerant quantum computers. To maximize the utility of these devices, it is important to develop quantum algorithms that match their capabilities and…
Solving electronic structure problems is considered one of the most promising applications of quantum computing. However, due to limitations imposed by the coherence time of qubits in the Noisy Intermediate Scale Quantum (NISQ) era or the…
We analyze the computational aspects of detecting topological order in a quantum many-body system. We contrast the widely used topological entanglement entropy with a recently introduced operational definition for topological order based on…
In this paper, we consider networks with topologies described by some connected undirected graph ${\mathcal{G}}=(V, E)$ and with some agents (fusion centers) equipped with processing power and local peer-to-peer communication, and…
Quantum coherence profoundly alters classical thermodynamic expectations by modifying the structure and accessibility of probability distributions. Classically, transitions to lower-entropy states (local second-law violations) are…
As quantum technologies mature, the development of tools for benchmarking their ability to prepare and manipulate complex quantum states becomes increasingly necessary. A key concept, the state overlap between two quantum states, offers a…