Papers

M. Barbeau, Joaquín García·Jul 5, 2019

We show that the Quantum Generative Adversarial Network (QGAN) paradigm can be employed by an adversary to learn generating data that deceives the monitoring of a Cyber- Physical System (CPS) and to perpetrate a covert attack. As a test case, the ide...

D. Egger, Ricardo García Gutiérrez, Jordi Cahu'e Mestre +1 more·Jul 5, 2019

We present and analyze a quantum algorithm to estimate credit risk more efficiently than Monte Carlo simulations can do on classical computers. More precisely, we estimate the economic capital requirement, i.e. the difference between the Value at Ris...

David K. Tuckett, S. Bartlett, S. Flammia +1 more·Jul 5, 2019

Noise in quantum computing is countered with quantum error correction. Achieving optimal performance will require tailoring codes and decoding algorithms to account for features of realistic noise, such as the common situation where the noise is bias...

N. Piparo, M. Hanks, C. Gravel +2 more·Jul 4, 2019

Distributed quantum information processing is based on the transmission of quantum data over lossy channels between quantum processing nodes. These nodes may be separated by a few microns or on planetary scale distances, but transmission losses due t...

Agnes Valenti, Evert P L van Nieuwenburg, S. Huber +1 more·Jul 4, 2019

The efficient validation of quantum devices is critical for emerging technological applications. In a wide class of use-cases the precise engineering of a Hamiltonian is required both for the implementation of gate-based quantum information processin...

Xiao Yuan, Yunchao Liu, Qi Zhao +3 more·Jul 4, 2019

Quantum memory—the capacity to faithfully preserve quantum coherence and correlations—is essential for quantum-enhanced technology. There is thus a pressing need for operationally meaningful means to benchmark candidate memories across diverse physic...

E. Gillman, F. Carollo, I. Lesanovsky·Jul 4, 2019

The simulation of out-of-equilibrium dissipative quantum many body systems is a problem of fundamental interest to a number of fields in physics, ranging from condensed matter to cosmology. For unitary systems, tensor network methods have proved succ...

M. Willsch, D. Willsch, F. Jin +2 more·Jul 4, 2019

The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation ratio. The s...

E. Kiktenko, A. Mastiukova, A. Fedorov·Jul 3, 2019

Abstract. Decoherence is a fundamental obstacle to the implementation of large-scale and low-noise quantum information-processing devices. We suggest an approach for suppressing errors by employing preprocessing and postprocessing unitary operations,...

Joschka Roffe·Jul 3, 2019

Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to gate compilat...

J. Ossorio-Castillo, J. Tornero·Jul 3, 2019

The (Diophantine) Frobenius problem is a well-known NP-hard problem (also called the stamp problem or the chicken nugget problem) whose origins lie in the realm of combinatorial number theory. In this paper we present an adiabatic quantum algorithm w...

Sean A. Fischer, D. Gunlycke·Jul 2, 2019

Quantum computing has the potential to significantly speed up complex computational tasks, and arguably the most promising application area for near-term quantum computers is the simulation of quantum mechanics. To make the most of our limited quantu...

V. Smelyanskiy, K. Kechedzhi, S. Boixo +2 more·Jul 2, 2019

Answering the question of existence of efficient quantum algorithms for NP-hard problems require deep theoretical understanding of the properties of the low-energy eigenstates and long-time coherent dynamics in quantum spin glasses. We discovered and...

Y. Ge, V. Dunjko·Jul 2, 2019

Recent works have shown that quantum computers can polynomially speed up certain SAT-solving algorithms even when the number of available qubits is significantly smaller than the number of variables. Here we generalise this approach. We present a fra...

A. Ashikhmin, C. Lai, T. Brun·Jul 2, 2019

Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of measured error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose syndrome measurement (SM) and...

Cai Zhang, M. Razavi, Zhiwei Sun +2 more·Jul 1, 2019

We present a secure multi-party quantum summation protocol based on quantum teleportation, in which a malicious, but non-collusive, third party (TP) helps compute the summation. In our protocol, TP is in charge of entanglement distribution and Bell s...

K. Shimizu, R. Mori·Jul 1, 2019

The fastest known classical algorithm deciding the k-colorability of n-vertex graph requires running time Ω(2n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \use...

Akshay Ajagekar, F. You·Jul 1, 2019

The purpose of this paper is to explore the applications of quantum computing to energy systems optimization problems and discuss some of the challenges faced by quantum computers with techniques to overcome them. The basic concepts underlying quantu...

H. McCabe, Scott Koziol, G. Snider +1 more·Jul 1, 2019

Random numbers are a valuable commodity in gaming and gambling, simulation, conventional and quantum cryptography, and in non-conventional computing schemes such as stochastic computing. We propose to generate a random bit using a position measuremen...

Samuel Yen-Chi Chen, Chao-Han Huck Yang, Jun Qi +3 more·Jun 30, 2019

The state-of-the-art machine learning approaches are based on classical von Neumann computing architectures and have been widely used in many industrial and academic domains. With the recent development of quantum computing, researchers and tech-gian...