Papers

A. Wozniakowski, Jayne Thompson, M. Gu +1 more·May 13, 2020

Traditional machine learning applications, such as optical character recognition, arose from the inability to explicitly program a computer to perform a routine task. In this context, learning algorithms usually derive a model exclusively from the ev...

S. Krinner, S. Lazăr, A. Remm +7 more·May 12, 2020

A major challenge in operating multi-qubit quantum processors is to mitigate multi-qubit coherent errors. For superconducting circuits, besides crosstalk originating from imperfect isolation of control lines, dispersive coupling between qubits is a m...

B. Harsha, Jeremiah Blocki·May 12, 2020

It has been established that quantum algorithms can solve several key cryptographic problems more efficiently than classical computers. As progress continues in the field of quantum computing it is important to understand the risks they pose to deplo...

Winston W. Wang, S. Prabhakar·May 12, 2020

Achieving small error for qubit gate operations under random telegraph noise (RTN) is of great interest for potential applications in quantum computing and quantum error correction. I calculate the error generated in the qubit driven by $\pi$, CORPSE...

M. Ganzhorn, G. Salis, D. Egger +8 more·May 12, 2020

The possibility to utilize different types of two-qubit gates on a single quantum computing platform adds flexibility in the decomposition of quantum algorithms. A larger hardware-native gate set may decrease the number of required gates, provided th...

S. Terashima·May 12, 2020

In this paper, we study the bulk local states in AdS/CFT correspondence in the large $N$ limit using the formula explicitly relating the bulk local operators and the CFT local operators. We identify the bulk local state in terms of CFT local states a...

Elliott Gesteau, M. Kang·May 12, 2020

We construct an infinite-dimensional analog of the HaPPY code as a growing series of stabilizer codes defined respective to their Hilbert spaces. The Hilbert spaces are related by isometric maps, which we define explicitly. We construct a Hamiltonian...

Gary J. Mooney, C. Hill, L. Hollenberg·May 12, 2020

For universal quantum computation, a major challenge to overcome for practical implementation is the large amount of resources required for fault-tolerant quantum information processing. An important aspect is implementing arbitrary unitary operators...

O. Golan, Adam Smith, Z. Ringel·May 12, 2020

The infamous sign problem leads to an exponential complexity in Monte Carlo simulations of generic many-body quantum systems. Nevertheless, many phases of matter are known to admit a sign-problem-free representative, allowing efficient simulations on...

Barnaby van Straaten, Bálint Koczor·May 11, 2020

Variational quantum algorithms are promising tools for near-term quantum computers as their shallow circuits are robust to experimental imperfections. Their practical applicability, however, strongly depends on how many times their circuits need to b...

N. Lacroix, C. Hellings, C. K. Andersen +10 more·May 11, 2020

Variational quantum algorithms are believed to be promising for solving computationally hard problems and are often comprised of repeated layers of quantum gates. An example thereof is the quantum approximate optimization algorithm (QAOA), an approac...

Boxi Li, T. Coopmans, David Elkouss·May 11, 2020

Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on the communication channel preclude the direct long-distance transmission of quantum information in many relevant scenarios. I...

Zvika Brakerski, Venkata Koppula, U. Vazirani +1 more·May 11, 2020

A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot. Providing a proof of quantumness is the first step...

Mazhar N. Ali·May 11, 2020

We study dynamics of local quantum uncertainty (LQU) for a system of two cavities and two reservoirs. In the start, the cavities treated as two qubits are quantum correlated with each other, whereas reservoirs are neither correlated with each other n...

A. Macaluso, L. Clissa, Stefano Lodi +1 more·May 11, 2020

Quantum Computing offers a new paradigm for efficient computing and many AI applications could benefit from its potential boost in performance. However, the main limitation is the constraint to linear operations that hampers the representation of com...

Ayan Chattopadhyay, V. Menon·May 10, 2020

The research community has been actively working on the realization of quantum computer. But the large scale commercial quantum computers are not a reality yet quantum computing field has become richer by day with the advent of algorithms and the ave...

Adam Holmes, A. Y. Matsuura·May 9, 2020

Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is intractably diff...

Yosi Atia, Shantanav Chakraborty·May 8, 2020

Continuous-time quantum walks have proven to be an extremely useful framework for the design of several quantum algorithms. Often, the running time of quantum algorithms in this framework is characterized by the quantum hitting time: the time require...

T. Sahai·May 8, 2020

This article surveys the burgeoning area at the intersection of dynamical systems theory and algorithms for NP-hard problems. Traditionally, computational complexity and the analysis of non-deterministic polynomial-time (NP)-hard problems have fallen...

Srinivasan Arunachalam, Supartha Podder·May 8, 2020

We study the communication complexity of computing functions $F:\{0,1\}^n \times \{0,1\}^n\rightarrow \{0,1\}$ in the memoryless communication model. Here, Alice and Bob are given $x\in \{0,1\}^n$, $y\in \{0,1\}^n$ respectively and their goal is to c...