Papers

Davide Ferrari, A. Cacciapuoti, M. Amoretti +1 more·Dec 17, 2020

In distributed quantum computing architectures, with the network and communications functionalities provided by the Quantum Internet, remote quantum processing units can communicate and cooperate for executing computational tasks that single, noisy, ...

Qisheng Wang, M. Ying·Dec 17, 2020

Lexicographically minimal string rotation (LMSR) is a problem to find the minimal one among all rotations of a string in the lexicographical order, which is widely used in equality checking of graphs, polygons, automata and chemical structures. In th...

Veit Langrock, D. DiVincenzo·Dec 17, 2020

We report a substantially simplified procedure, based on group-theoretic reasoning, for the reduction of qubit leakage in exchange-only spin qubits. We to find exchange sequences which accomplish leakage reduction with only two additional spins and w...

S. Martiel, T. Brugière·Dec 17, 2020

Qubit routing is a key problem for quantum circuit compilation. It consists in rewriting a quantum circuit by adding the least possible number of instructions to make the circuit compliant with some architecture's connectivity constraints. Usually, t...

E. Wiegand, P. Wen, P. Delsing +2 more·Dec 17, 2020

We investigate three types of amplification processes for light fields coupling to an atom near the end of a one-dimensional (1D) semi-infinite waveguide. We consider two setups where a drive creates population inversion in the bare or dressed basis ...

Xin-Chuan Wu, M. Davis, F. Chong +1 more·Dec 17, 2020

—The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthe...

M. Dall’Arno, F. Buscemi, Takeshi Koshiba·Dec 17, 2020

The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a time. Here, we derive analytical solutions of the guesswork problem s...

R. Nikandish, E. Blokhina, D. Leipold +1 more·Dec 16, 2020

Quantum computing has the potential to create a paradigm shift in computing technology, which can lead to breakthroughs in emerging applications that rely on ultra-high-performance computing, e.g., artificial intelligence. Among several implementatio...

Mingyou Wu, Zhihao Liu, Hanwu Chen·Dec 16, 2020

An enhanced framework of quantum approximate optimization algorithm (QAOA) is introduced and the parameter setting strategies are analyzed. The enhanced QAOA is as effective as the QAOA but exhibits greater computing power and flexibility, and with p...

P. Slater·Dec 16, 2020

Employing the volume of quantum steering ellipsoids (QSEs) as a measure on the fifteen-dimensional convex set of two-qubit states, we estimate the ratio of the integral of the measure over the separable states to its integral over all (separable and ...

E. Campbell·Dec 16, 2020

Simulation of the Hubbard model is a leading candidate for the first useful applications of a fault-tolerant quantum computer. A recent study of quantum algorithms for early simulations of the Hubbard model [Kivlichan et al 2019 Quantum 4 296] found ...

Marc Vuffray, Carleton Coffrin, Y. Kharkov +1 more·Dec 16, 2020

Drawing independent samples from high-dimensional probability distributions represents the major computational bottleneck for modern algorithms, including powerful machine learning frameworks such as deep learning. The quest for discovering larger fa...

M. Cerezo, A. Arrasmith, R. Babbush +8 more·Dec 16, 2020

Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers, owing to the extremely high computational cost. Quantum computers promise a solution, although fa...

J. J. Van De Wetering·Dec 16, 2020

There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and two-qubit CNOT gates. A CNOT gate is however not alway...

Sai Li, Z. Xue·Dec 16, 2020

The key for realizing fault-tolerant quantum computation lies in maintaining the coherence of all the qubits so that high-fidelity and robust qubit manipulations can be achievable. One of the promising approaches is to use geometric phases in the con...

M. Avesani, L. Calderaro, Giulio Foletto +9 more·Dec 15, 2020

Field trials are of key importance for novel technologies seeking commercialization and widespread adoption. This is also the case for quantum key distribution (QKD), which allows distant parties to distill a secret key with unconditional security. T...

R. Bennink·Dec 15, 2020

I present a method for estimating the fidelity F ( μ ,  τ ) between a preparable quantum state μ and a classically specified pure target state $$\tau =\left|\tau \right\rangle \left\langle \tau \right|$$ τ = τ τ , using simple quantum circuits and on...

E. Zhang, S. Srinivasan, N. Sundaresan +19 more·Dec 15, 2020

Scaling the number of qubits while maintaining high-fidelity quantum gates remains a key challenge for quantum computing. Presently, superconducting quantum processors with >50-qubits are actively available. For such systems, fixed-frequency transmon...

F. Faramarzi, P. Day, J. Glasby +7 more·Dec 15, 2020

Superconducting qubits are widely used in quantum computing research and industry. We describe a superconducting kinetic inductance qubit (and introduce the term Kineticon to describe it) operating at W-band frequencies with a nonlinear nanowire sect...

Chenfeng Cao, Xin Wang·Dec 15, 2020

Quantum autoencoder is an efficient variational quantum algorithm for quantum data compression. However, previous quantum autoencoders fail to compress and recover high-rank mixed states. In this work, we discuss the fundamental properties and limita...