Papers

G. Cui, Zhimin Wang, Shengbin Wang +5 more·Aug 27, 2021

Solving differential equations is one of the most promising applications of quantum computing. Recently we proposed an efficient quantum algorithm for solving one-dimensional Poisson equation avoiding the need to perform quantum arithmetic or Hamilto...

Jessica Thompson, Ojas D. Parekh, Kunal Marwaha·Aug 27, 2021

We give an approximation algorithm for MaxCut and provide guarantees on the average fraction of edges cut on $d$-regular graphs of girth $\geq 2k$. For every $d \geq 3$ and $k \geq 4$, our approximation guarantees are better than those of all other c...

Waheeda Saib, P. Wallden, I. Akhalwaya·Aug 27, 2021

Variational quantum algorithms are suitable for use on noisy quantum systems. One of the most important use-cases is the quantum simulation of materials, using the variational quantum eigensolver (VQE). To optimize VQE performance, a suitable paramet...

Yassine Hamoudi·Aug 27, 2021

We present a new quantum algorithm for estimating the mean of a real-valued random variable obtained as the output of a quantum computation. Our estimator achieves a nearly-optimal quadratic speedup over the number of classical i.i.d. samples needed ...

Jesse Berwald, N. Chancellor, Raouf Dridi·Aug 26, 2021

We analyse the method of encoding pairwise interactions of higher-than-binary discrete variables (these models are sometimes referred to as discrete quadratic models) into binary variables based on domain walls on one-dimensional Ising chains. We dis...

Siyi Yang, N. Guo, M. Santha +1 more·Aug 26, 2021

At the interface of machine learning and quantum computing, an important question is what distributions can be learned provably with optimal sample complexities and with quantum-accelerated time complexities. In the classical case, Klivans and Goel d...

X. Gu, Jorge Fernández-Pendás, Pontus Vikstål +8 more·Aug 25, 2021

Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such devices. One wa...

K. Sahay, Benjamin J. Brown·Aug 25, 2021

The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation. Here we propose a decoder for the planar color code...

Ciaran Hughes, Doug Finke, Dan-Adrian German +3 more·Aug 25, 2021

Background: Quantum information science and technology (QIST) has progressed significantly in the last decade, such that it is no longer solely in the domain of research labs, but is now beginning to be developed for, and applied in, industrial appli...

H. K. J., A. Pal·Aug 25, 2021

We investigate the static and the dynamical behavior of localizable entanglement and its lower bounds on nontrivial loops of topological quantum codes with parallel magnetic field. Exploiting the connection between the stabilizer states and graph stat...

Adrien Suau, J. Nelson, Marc Vuffray +3 more·Aug 25, 2021

As a variety of quantum computing models and platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance. Despite being built of the same fundamental computational unit, r...

M. Sapova, A. Fedorov·Aug 25, 2021

Variational Quantum Eigensolver (VQE) methods aim to maximize the resources of existing noisy devices. However, they encounter difficulties in simulating molecules of industrially-relevant sizes, such as constructing the efficient ansatz. Adaptive va...

G. Mazzola·Aug 25, 2021

The quest for improved sampling methods to solve statistical mechanics problems of physical and chemical interest proceeds with renewed efforts since the invention of the Metropolis algorithm, in 1953. In particular, the understanding of thermally ac...

Yilei Chen, Qipeng Liu, Mark Zhandry·Aug 25, 2021

We show polynomial-time quantum algorithms for the following problems: (*) Short integer solution (SIS) problem under the infinity norm, where the public matrix is very wide, the modulus is a polynomially large prime, and the bound of infinity norm ...

G. S. Martín, E. Droguett·Aug 25, 2021

Quantum computing is a new field that has recently attracted researchers from a broad range of fields due to its representation power, flexibility and promising results in both speed and scalability. Since 2020, laboratories around the globe have sta...

Aidan Pellow-Jarman, I. Sinayskiy, A. Pillay +1 more·Aug 25, 2021

Finding solutions to systems of linear equations is a common problem in many areas of science and engineering, with much potential for a speed up on quantum devices. While the Harrow–Hassidim–Lloyd (HHL) quantum algorithm yields up to an exponential ...

I. J. David, I. Sinayskiy, Francesco Petruccione·Aug 25, 2021

Quantum algorithms for simulating quantum systems provide a clear and provable advantage over classical algorithms in fault-tolerant settings. There is also interest in quantum algorithms and their implementation in Noisy Intermediate Scale Quantum (...

A. Chatterjee, Fabio Ansaloni, Torbjørn Rasmussen +5 more·Aug 24, 2021

Quantum dot arrays possess ground states governed by Coulomb energies, utilized prominently by singly occupied quantum dots, each implementing a spin qubit. For such quantum processors, the controlled transitions between ground states are of operatio...

T. Tanamoto, K. Ono·Aug 24, 2021

Single-electron transistors (SETs) have been extensively used as charge sensors in many areas such as quantum computations. In general, the signals of SETs are smaller than those of complementary metal-oxide semiconductor (CMOS) devices, and many amp...

Maria-Andreea Filip, Nathan Fitzpatrick, David Muñoz Ramo +1 more·Aug 24, 2021

Unitary Coupled Cluster (UCC) approaches are an appealing route to utilising quantum hardware to perform quantum chemistry calculations, as quantum computers can in principle perform UCC calculations in a polynomially scaling fashion, as compared to ...