Papers

Xiao-Ling Pang, Lu-Feng Qiao, Ke Sun +3 more·Apr 9, 2019

The Internet of Things (IoT), as a cutting-edge integrated cross-technology, promises to informationize people’s daily lives, while being threatened by continuous challenges of eavesdropping and tampering. The emerging quantum cryptography, harnessin...

Maxwell P. Henderson, Samriddhi Shakya, S. Pradhan +1 more·Apr 9, 2019

Convolutional neural networks (CNNs) have rapidly risen in popularity for many machine learning applications, particularly in the field of image recognition. Much of the benefit generated from these networks comes from their ability to extract featur...

F. Mascherpa, A. Smirne, D. Tamascelli +4 more·Apr 9, 2019

A method for the systematic construction of few-body damped harmonic oscillator networks accurately reproducing the effect of general bosonic environments in open quantum systems is presented. Under the sole assumptions of a Gaussian environment and ...

C. Bruzewicz, J. Chiaverini, R. McConnell +1 more·Apr 8, 2019

Trapped ions are among the most promising systems for practical quantum computing (QC). The basic requirements for universal QC have all been demonstrated with ions, and quantum algorithms using few-ion-qubit systems have been implemented. We review ...

Abdullah Ash-Saki, M. Alam, Swaroop Ghosh·Apr 8, 2019

Decoherence of quantum states is a major hurdle towards scalable and reliable quantum computing. Lower decoherence (i.e., higher fidelity) can alleviate the error correction overhead and obviate the need for energy-intensive noise reduction technique...

Masayuki Miyamoto, M. Iwamura, K. Kise·Apr 7, 2019

Minimum Steiner tree problem is a well-known NP-hard problem. For the minimum Steiner tree problem in graphs with $n$ vertices and $k$ terminals, there are many classical algorithms that take exponential time in $k$. In this paper, to the best of our...

H. Barnum, J. Hilgert·Apr 7, 2019

We show that the strongly symmetric spectral convex compact sets are precisely the normalized state spaces of finite-dimensional simple Euclidean Jordan algebras and the simplices. Spectrality is the property that every state has a convex decompositi...

Nengkun Yu·Apr 5, 2019

One of the main subjects of this paper is to study quantum property testing with local measurement. In particular, we establish a novel $\ell_2$ norm connection between quantum property testing problems and the corresponding distribution testing prob...

Joran van Apeldoorn, Andr'as Gily'en·Apr 5, 2019

We derive sublinear-time quantum algorithms for computing the Nash equilibrium of two-player zero-sum games, based on efficient Gibbs sampling methods. We are able to achieve speed-ups for both dense and sparse payoff matrices at the cost of a mildly...

R. Parrish, Joseph Iosue, A. Ozaeta +1 more·Apr 5, 2019

The optimization of circuit parameters of variational quantum algorithms such as the variational quantum eigensolver (VQE) or the quantum approximate optimization algorithm (QAOA) is a key challenge for the practical deployment of near-term quantum c...

R. W. Bomantara, J. Gong·Apr 5, 2019

Majorana modes, typically arising at the edges of one-dimensional topological superconductors, are considered to be a promising candidate for encoding nonlocal qubits in fault-tolerant quantum computing. Here we exploit the two-dimensional geometry o...

O. M. Sotnikov, V. Mazurenko·Apr 4, 2019

Quantum computing is expected to provide new promising approaches for solving the most challenging problems in material science, communication, search, machine learning and other domains. However, due to the decoherence and gate imperfection errors m...

Hongsheng Qi, I. Petersen, Guodong Shi·Apr 4, 2019

In this paper, we study dynamical quantum networks which evolve according to Schrodinger equations but subject to sequential local or global quantum measurements. A network of qubits forms a composite quantum system whose state undergoes unitary evol...

H. Haas, D. Puzzuoli, Fei-Hao Zhang +1 more·Apr 4, 2019

In the field of quantum control, effective Hamiltonian engineering is a powerful tool that utilizes perturbation theory to mitigate or enhance the effect that a variation in the Hamiltonian has on the evolution of the system. Here, we provide a gener...

Tongyang Li, Shouvanik Chakrabarti, Xiaodi Wu·Apr 4, 2019

We investigate quantum algorithms for classification, a fundamental problem in machine learning, with provable guarantees. Given $n$ $d$-dimensional data points, the state-of-the-art (and optimal) classical algorithm for training classifiers with con...

Aleksandrs Belovs·Apr 3, 2019

We study quantum algorithms working on classical probability distributions. We formulate four different models for accessing a classical probability distribution on a quantum computer, which are derived from previous work on the topic, and study thei...

Beatrice Nash, Vlad Gheorghiu, M. Mosca·Apr 3, 2019

Currently available quantum computing hardware platforms have limited 2-qubit connectivity among their addressable qubits. In order to run a generic quantum algorithm on such a platform, one has to transform the initial logical quantum circuit descri...

M. Usman, Yi Z. Wong, C. Hill +1 more·Apr 3, 2019

Atomic-level qubits in silicon are attractive candidates for large-scale quantum computing; however, their quantum properties and controllability are sensitive to details such as the number of donor atoms comprising a qubit and their precise location...

B. Bertini, Pavel Kos, T. Prosen·Apr 3, 2019

We consider a class of quantum lattice models in 1+1 dimensions represented as local quantum circuits that enjoy a particular dual-unitarity property. In essence, this property ensures that both the evolution in time and that in space are given in te...

S. Bravyi, David Gosset, Robert Koenig +1 more·Apr 2, 2019

Prior work has shown that there exists a relation problem which can be solved with certainty by a constant-depth quantum circuit composed of geometrically local gates in two dimensions, but cannot be solved with high probability by any classical cons...