Papers

Bartosz Regula, Ludovico Lami, A. Streltsov·Jul 12, 2018

We characterize the operational task of environment-assisted distillation of quantum coherence under different sets of free operations when only a finite supply of copies of a given state is available. We first evaluate the one-shot assisted distilla...

E. Dumitrescu, A. L. Fisher, T. Goodrich +3 more·Jul 12, 2018

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ...

I. Horv'ath, R. Mendris·Jul 11, 2018

Quantum physics frequently involves a need to count the states, subspaces, measurement outcomes and other elements of quantum dynamics. However, with quantum mechanics assigning probabilities to such objects, it is often desirable to work with the no...

R. Patel, T. Rudolph, G. Pryde·Jul 11, 2018

Quantum coherence and entanglement offer a quantum advantage, over classical physics, in a randomness processing task. There has been a concerted effort to identify problems computable with quantum technology, which are intractable with classical tec...

Theodoros Kapourniotis, A. Datta·Jul 11, 2018

We introduce the notion of fault-tolerant quantum metrology to overcome noise beyond our control, associated with sensing the parameter, by reducing the noise in operations under our control, associated with preparing and measuring probes and ancilla...

Akshaya Jayashankar, Prabha Mandayam·Jul 11, 2018

We examine the role of quantum error correction (QEC) in achieving pretty good quantum state transfer over a class of $1$-d spin Hamiltonians. Recasting the problem of state transfer as one of information transmission over an underlying quantum chann...

G. Low·Jul 11, 2018

We present a quantum algorithm for approximating the real time evolution e−iHt of an arbitrary d-sparse Hamiltonian to error є, given black-box access to the positions and b-bit values of its non-zero matrix entries. The query complexity of our algor...

Ewin Tang·Jul 10, 2018

We give a classical analogue to Kerenidis and Prakash’s quantum recommendation system, previously believed to be one of the strongest candidates for provably exponential speedups in quantum machine learning. Our main result is an algorithm that, give...

R. Orús, Samuel Mugel, Enrique Lizaso·Jul 10, 2018

Abstract We discuss how quantum computation can be applied to financial problems, providing an overview of current approaches and potential prospects. We review quantum optimization algorithms, and expose how quantum annealers can be used to optimize...

Peter Bruin·Jul 10, 2018

We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field $\mathbf{F}$ of $q$ elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard basis, all Kloo...

C. Stephen, B. Green, Y. Lekhai +11 more·Jul 10, 2018

Three-dimensional arrays of silicon transistors increase the density of bits. Solid-state qubits are much larger so could benefit even more from using the third dimension given that useful fault-tolerant quantum computing will require at least 100,00...

Q. Guo, Shi-Biao Zheng, Jianwen Wang +11 more·Jul 10, 2018

A central task towards building a practical quantum computer is to protect individual qubits from decoherence while retaining the ability to perform high-fidelity entangling gates involving arbitrary two qubits. Here we propose and demonstrate a deph...

N. Nguyen, E. Behrman, M. A. Moustafa +1 more·Jul 9, 2018

The power of quantum computers is still somewhat speculative. Although they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical complexity theo...

Y. Sanders, G. Low, A. Scherer +1 more·Jul 9, 2018

Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids...

Peng‐Bo Li, F. Nori·Jul 8, 2018

In spin-based hybrid quantum systems, the spatial modes of collective spin excitations can be used to encode a register of qubits. However, in superconducting circuits the wavelengths of microwave photons are much larger than the dimensions of the sp...

Thomas Häner, M. Rötteler, K. Svore·Jul 6, 2018

We address the problem of distributing approximation errors in large-scale quantum programs. It has been known for some time that when compiling quantum algorithms for a fault-tolerant architecture, some operations must be approximated as they cannot...

Sam McArdle, Xiao Yuan, S. Benjamin·Jul 6, 2018

Variational algorithms may enable classically intractable simulations on near-future quantum computers. However, their potential is limited by hardware errors. It is therefore crucial to develop efficient ways to mitigate these errors. Here, we propo...

C. Elouard, A. Auffèves, G. Haack·Jul 6, 2018

Producing and certifying entanglement between distant qubits is a highly desirable skill for quantum information technologies. Here we propose a new strategy to monitor and characterize entanglement genesis in a half parity measurement setup, that re...

Thomas Haener, Mathias Soeken, M. Roetteler +1 more·Jul 5, 2018

Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a set of fau...

Xin Zhang, Hong Xiang, Tao Xiang +2 more·Jul 4, 2018

Recently, the development of quantum chips has made great progress-- the number of qubits is increasing and the fidelity is getting higher. However, qubits of these chips are not always fully connected, which sets additional barriers for implementing...