Papers

Chris Cade, Marten Folkertsma, I. Niesen +1 more·Mar 11, 2022

We apply recent work~\cite{ourotherpaper} on empirical estimates of quantum speedups to the practical task of community detection in complex networks. We design several quantum variants of a popular classical algorithm -- the \textit{Louvain algorith...

Sergi Ramos-Calderer·Mar 11, 2022

We present efficient methods to interpolate data with a quantum computer that complement uploading techniques and quantum post-processing. The quantum algorithms are supported by the efficient Quantum Fourier Transform (QFT) and classical signal and imag...

John Napp·Mar 11, 2022

Quantifying the flatness of the objective-function landscape associated with unstructured parameterized quantum circuits is important for understanding the performance of variational algorithms utilizing a"hardware-efficient ansatz", particularly for...

H. Buhrman, B. Loff, Subhasree Patro +1 more·Mar 10, 2022

In the classical RAM, we have the following useful property. If we have an algorithm that uses $M$ memory cells throughout its execution, and in addition is sparse, in the sense that, at any point in time, only $m$ out of $M$ cells will be non-zero, ...

Y. Afik, J. R. M. Nova·Mar 10, 2022

Top quarks represent unique high-energy systems since their spin correlations can be measured, thus allowing to study fundamental aspects of quantum mechanics with qubits at high-energy colliders. We present here the general framework of the quantum ...

Wassil Sennane, Jean‐Philip Piquemal, M. Rančić·Mar 10, 2022

In this manuscript, we calculate the ground state energy of benzene under spatial deformations by using the variational quantum eigensolver (VQE). The primary goal of the study is estimating the feasibility of using quantum computing ansatze on near-...

Chris Cade, Marten Folkertsma, I. Niesen +1 more·Mar 9, 2022

Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms with a large worst-case run-time to end up performing well on instances...

V. Chandrasekaran, A. Levine·Mar 9, 2022

We analyze the error correcting properties of the Sachdev-Ye-Kitaev model, with errors that correspond to erasures of subsets of fermions. We study the limit where the number of fermions erased is large but small compared to the total number of fermi...

Jeong Yu Han, Bin Cheng, Dinh-Long Vu +1 more·Mar 9, 2022

A critical problem in the financial world deals with the management of risk, from regulatory risk to portfolio risk. Many such problems involve the analysis of securities modelled by complex dynamics that cannot be captured analytically, and hence re...

R. Wiersema, L. Guerini, J. Carrasquilla +1 more·Mar 9, 2022

High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. As main technical tool, we introduce quantum-classical-quantum interfa...

Oriel Kiss, F. Tacchino, S. Vallecorsa +1 more·Mar 9, 2022

Accurate molecular force fields are of paramount importance for the efficient implementation of molecular dynamics techniques at large scales. In the last decade, machine learning (ML) methods have demonstrated impressive performances in predicting a...

S. E. Rasmussen, N. Zinner·Mar 9, 2022

The variational quantum eigensolver is a prominent hybrid quantum‐classical algorithm expected to impact near‐term quantum devices. They are usually based on a circuit ansatz consisting of parameterized single‐qubit gates and fixed two‐qubit gates. T...

Xing Chen, Minsik Kwon, V. Vorobyov +2 more·Mar 9, 2022

Randomness is a very important resource for cryptography, algorithms, and scientific simulations. Since all classical processes are considered to be intrinsically deterministic, we must build quantum random number generators which utilize quantum pro...

Salvatore Certo, Anh Pham, D. Beaulieu·Mar 9, 2022

One of the problems frequently mentioned as a candidate for quantum advantage is that of selecting a portfolio of financial assets to maximize returns while minimizing risk. In this paper we formulate several real-world constraints for use in a Quant...

Xuanqiang Zhao, Benchi Zhao, Zihan Xia +1 more·Mar 9, 2022

Extracting classical information from quantum systems is an essential step of many quantum algorithms. However, this information could be corrupted as the systems are prone to quantum noises, and its distortion under quantum dynamics has not been ade...

O. Higgott, T. Bohdanowicz, Aleksander Kubica +2 more·Mar 9, 2022

Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code. QEC codes use multiple noisy physical qubits to encode information in fewer logic...

P. Rakyta, Z. Zimbor'as·Mar 8, 2022

In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to transform ...

Anqi Zhang, Xiaoyun He, Sheng-mei Zhao·Mar 8, 2022

Using the properties of quantum superposition, we propose a quantum classification algorithm to efficiently perform multi-class classification tasks, where the training data are loaded into parameterized operators which are applied to the basis of th...

M. Wallerberger, K. Held·Mar 8, 2022

Ranking bit patterns—finding the index of a given pattern in an ordered sequence—is a major bottleneck scaling up numerical quantum many-body calculations, as fermionic and hard-core bosonic states translate naturally to bit patterns. Traditionally, r...

Jin Ming Koh, Shi-Ning Sun, M. Motta +1 more·Mar 8, 2022

Quantum many-body systems subjected to unitary evolution with the addition of interspersed measurements exhibit a variety of dynamical phases that do not occur under pure unitary evolution. However, these systems remain challenging to investigate on ...