Papers

Zhanning Wang, E. Marcellina, A. Hamilton +3 more·Nov 25, 2019

Strong spin-orbit interactions make hole quantum dots central to the quest for electrical spin qubit manipulation enabling fast, low-power, scalable quantum computation. Yet it is important to establish to what extent spin-orbit coupling may expose t...

I. O. Sokolov, P. Barkoutsos, Pauline J. Ollitrault +4 more·Nov 25, 2019

The Coupled Cluster (CC) method is used to compute the electronic correlation energy in atoms and molecules and often leads to highly accurate results. However, due to its single-reference nature, standard CC in its projected form fails to describe q...

A. Alexandru, P. Bedaque, S. Lawrence·Nov 25, 2019

We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body disordered syste...

Sami Khairy, Ruslan Shaydulin, L. Cincio +2 more·Nov 25, 2019

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for de...

G. Mbeng, R. Fazio, G. Santoro·Nov 25, 2019

We show how a digitized version of Quantum Annealing can be made optimal, realizing the best possible solution allowed by quantum mechanics in the shortest time, without any prior knowledge on the location and properties of the spectral gap. Our find...

A. Khrennikov·Nov 23, 2019

The recent Google's claim on breakthrough in quantum computing is a gong signal for further analysis of foundational roots of (possible) superiority of some quantum algorithms over the corresponding classical algorithms. This note is a step in this d...

S. Kanno, T. Tada·Nov 23, 2019

A state of the art method based on quantum variational algorithms can be a powerful approach for solving quantum many-body problems. However, the research scope in the field is mainly limited to organic molecules and simple lattice models. Here, we p...

Mingjian He, R. Malaney, J. Green·Nov 23, 2019

Non-Gaussian operations have been studied intensively in recent years due to their ability to increase the secret key rate for certain CV-QKD protocols. However, most previous studies on such protocols are carried out in a single-mode setting, even t...

Kohtaro Kato, F. Brandão·Nov 22, 2019

Topological entanglement entropy has been extensively used as an indicator of topologically ordered phases. However, it has been observed that there exist ground states in the topologically trivial phase that has nonzero "spurious" contribution to th...

C. Galindo, Fernando Hernando, R. Matsumoto +1 more·Nov 22, 2019

The concept of asymmetric entanglement-assisted quantum error-correcting code (asymmetric EAQECC) is introduced in this article. Codes of this type take advantage of the asymmetry in quantum errors since phase-shift errors are more probable than qudi...

Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Avradip Mandal +3 more·Nov 22, 2019

Many combinatorial scientific computing problems are NP-hard which in practice requires using heuristics that either decompose a large-scale problem and solve many smaller local subproblems in parallel or iteratively improve the solution by local pro...

Ho Lun Tang, Edwin Barnes, Harper R. Grimsley +2 more·Nov 22, 2019

Quantum simulation, one of the most promising applications of a quantum computer, is currently being explored intensely using the variational quantum eigensolver. The feasibility and performance of this algorithm depend critically on the form of the ...

Kishor Bharti, Maharshi Ray, Antonios Varvitsiotis +2 more·Nov 21, 2019

The onset of the era of fully-programmable error-corrected quantum computers will be marked by major breakthroughs in all areas of science and engineering. These devices promise to have significant technological and societal impact, notable examples ...

Kai-Min Chung, Tai-Ning Liao, Luowen Qian·Nov 20, 2019

Function inversion is the problem that given a random function $f: [M] \to [N]$, we want to find pre-image of any image $f^{-1}(y)$ in time $T$. In this work, we revisit this problem under the preprocessing model where we can compute some auxiliary i...

X. Xue, B. D’Anjou, T. Watson +8 more·Nov 19, 2019

An experiment measures an individual electron spin with high fidelity and without demolishing it, thus setting the stage for robust quantum error correction with spin qubits in silicon.

Anne Broadbent, A. Grilo·Nov 18, 2019

We provide several advances to the understanding of the class of Quantum Merlin-Arthur proof systems (QMA), the quantum analogue of NP. Our central contribution is proving a longstanding conjecture that the Consistency of Local Density Matrices (CLDM...

X. Cao·Nov 18, 2019

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a special att...

P. Ananth, R. L. Placa·Nov 18, 2019

Knowledge extraction, typically studied in the classical setting, is at the heart of several cryptographic protocols. We introduce the notion of secure quantum extraction protocols. A secure quantum extraction protocol for an NP relation $\mathcal{R}...

Simon Apers, R. D. Wolf·Nov 17, 2019

Graph sparsification underlies a large number of algorithms, ranging from approximation algorithms for cut problems to solvers for linear systems in the graph Laplacian. In its strongest form, “spectral sparsification” reduces the number of edges to ...

Venkateswara Dasari, Mee Seong Im, L. Beshaj·Nov 17, 2019

Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine learning al...