Papers

T. Manovitz, Yotam Shapira, L. Gazit +2 more·Nov 7, 2021

Quantum computers are expected to achieve a significant speed-up over classical computers in solving a range of computational problems. Chains of ions held in a linear Paul trap are a promising platform for constructing such quantum computers, due to...

Scott N. Genin, I. G. Ryabinkin, Nathan R. Paisley +3 more·Nov 7, 2021

Here we calculate T1 →S0 transition energies in nine phosphorescent iridium complexes using the iterative qubit coupled cluster (iQCC) method to determine if quantum simulations have any advantages over classical methods. These simulations would requ...

Jonathan Foldager, Arthur Pesah, L. K. Hansen·Nov 6, 2021

Preparing thermal states on a quantum computer can have a variety of applications, from simulating many-body quantum systems to training machine learning models. Variational circuits have been proposed for this task on near-term quantum computers, bu...

Xiaoliang Wu, Alexander Kolar, Joaquín Chung +3 more·Nov 6, 2021

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs a...

Omer Subasi, S. Krishnamoorthy·Nov 5, 2021

In this work, we explore the impact of logical stochastic Pauli and coherent Z-rotation errors on quantum algorithms. We evaluate six canonical quantum algorithms' intrinsic resilience to the logical qubit and gate errors by performing the Monte Carl...

Jonas Landman·Nov 5, 2021

Cette thèse vise à étudier si les algorithmes quantiques peuvent être utilisés dans le domaine de l'apprentissage automatique, ou intelligence artificielle. Nous rappelons d'abord les principes fondamentaux de l'apprentissage automatique et de l'in...

Nicholas P. Bauman, K. Kowalski·Nov 5, 2021

The recently introduced coupled cluster (CC) downfolding techniques for reducing the dimensionality of quantum many-body problems recast the CC formalism in the form of the renormalization procedure allowing, for the construction of effective (or dow...

Xiantao Li, Chunhao Wang·Nov 5, 2021

Non-Markovian open quantum systems represent the most general dynamics when the quantum system is coupled with a bath environment. The quantum dynamics arising from many important applications are non-Markovian. Although for special cases, such as Ha...

Dimitrios Patramanis·Nov 5, 2021

In this work we probe the operator growth for systems with Lie symmetry using tools from quantum information. Namely, we investigate the Krylov complexity, entanglement negativity, von Neumann entropy and capacity of entanglement for systems with SU(...

Blake Gerard, Martin Kong·Nov 5, 2021

One of the key compilation steps in Quantum Computing (QC) is to determine an initial logical to physical mapping of the qubits used in a quantum circuit. The impact of the starting qubit layout can vastly affect later scheduling and placement decisi...

K. Kobayashi·Nov 5, 2021

In recent years, Arenz et al. proposed the idea of reachable set characterization based on the quantum speed limit (QSL); that is, the reachable set of the target unitary gate in a closed qubit system can be characterized by considering the QSL as th...

Feng Pan, Keyang Chen, P. Zhang·Nov 4, 2021

We study the problem of generating independent samples from the output distribution of Google's Sycamore quantum circuits with a target fidelity, which is believed to be beyond the reach of classical supercomputers and has been used to demonstrate qu...

Dong An, Di Fang, Lin Lin·Nov 4, 2021

We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm that is bot...

R. East, P. Martin-Dussaud, J. Wetering·Nov 4, 2021

The ZX-calculus, and the variant we consider in this paper, the ZXH-calculus, are formal diagrammatic languages for qubit quantum computing. In this paper we will show that this language can also be used to describe SU(2) representation theory. To ac...

Nishant Jain, Brian Coyle, E. Kashefi +1 more·Nov 4, 2021

Approximate combinatorial optimisation has emerged as one of the most promising application areas for quantum computers, particularly those in the near term. In this work, we focus on the quantum approximate optimisation algorithm (QAOA) for solving ...

Federico Gallina, Matteo Bruschi, B. Fresch·Nov 4, 2021

Simulating charge and energy transfer in extended molecular networks requires an effective model to include the environment because it significantly affects the quantum dynamics. A prototypical effect known as environment-assisted quantum transport (...

Norihito Shirai, K. Kubo, K. Mitarai +1 more·Nov 4, 2021

The quantum kernel method is one of the key approaches to quantum machine learning, which has the advantage of not requiring optimization and its theoretical simplicity. By virtue of these properties, several experimental demonstrations and discussio...

Alexander Meiburg·Nov 4, 2021

Matrix permanents are hard to compute or even estimate in general. It had been previously suggested that the permanents of Positive Semidefinite (PSD) matrices may have efficient approximations. By relating PSD permanents to a task in quantum state t...

S. Irani, Anand Natarajan, Chinmay Nirkhe +2 more·Nov 4, 2021

It is a useful fact in classical computer science that many search problems are reducible to decision problems; this has led to decision problems being regarded as the de facto computational task to study in complexity theory. In this work, we explor...

Israel F. Araujo, Carsten Blank, Ismael C. S. Araújo +1 more·Nov 4, 2021

Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for nonstructured data is exponential on the number of qubits. Several works address this problem, f...