Papers

Shibdas Roy·Jan 24, 2023

The complexity class $PSPACE$ includes all computational problems that can be solved by a classical computer with polynomial memory. All $PSPACE$ problems are known to be solvable by a quantum computer too with polynomial memory and are, thus, known ...

R. Mezher, Ana Filipa Carvalho, Shane Mansfield·Jan 23, 2023

An important challenge for current and near-term quantum devices is finding useful tasks that can be preformed on them. We first show how to efficiently encode a bounded $n\times n$ matrix $A$ into a linear optical circuit with $2n$ modes. We then ap...

Raghav G. Jha·Jan 23, 2023

We discuss fundamentals of quantum computing and information - quantum gates, circuits, algorithms, theorems, error correction, and provide collection of QISKIT programs and exercises for the interested reader.

Namitha Liyanage, Yue Wu, Alexander Dennisovich Deters +1 more·Jan 20, 2023

A fault-tolerant quantum computer must decode and correct errors faster than they appear. The faster errors can be corrected, the more time the computer can do useful work. The Union-Find (UF) decoder is promising with an average time complexity slig...

Zoubeir Mlika, S. Cherkaoui, J. Laprade +1 more·Jan 20, 2023

This paper applies a quantum machine learning technique to predict mobile users' trajectories in mobile wireless networks using an approach called quantum reservoir computing (QRC). Mobile users' trajectories prediction belongs to the task of tempora...

Q. Li, Xiaoming Sun, Xingjian Zhang +1 more·Jan 20, 2023

Randomness extraction is a key problem in cryptography and theoretical computer science. With the recent rapid development of quantum cryptography, quantum‐proof randomness extraction has also been widely studied, addressing the security issues in th...

Andrew K. Tan, Yuan Liu, Minh C. Tran +1 more·Jan 20, 2023

The intrinsic probabilistic nature of quantum systems makes error correction or mitigation indis-pensable for quantum computation. While current error-correcting strategies focus on correcting errors in quantum states or quantum gates, these fine-grai...

J. Ziegler, F. Luthi, Michael S. Ramsey +3 more·Jan 20, 2023

Gate-defined quantum dots (QDs) have appealing attributes as a quantum computing platform. However, near-term devices possess a range of possible imperfections that need to be accounted for during the tuning and operation of QD devices. One such prob...

Elijah Pelofske·Jan 20, 2023

Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network mino...

F. Ponce, J. Orrell, Zheming Wang·Jan 19, 2023

This report estimates the potential for secondary emission processes induced by ionizing radiation to result in the generation of quasiparticles in superconducting circuits. These estimates are based on evaluation of data collected from a small super...

J. Balewski, Mercy G. Amankwah, R. Beeumen +3 more·Jan 19, 2023

Compact quantum data representations are essential to the emerging field of quantum algorithms for data analysis. We introduce two new data encoding schemes, QCrank and QBArt, which have a high degree of quantum parallelism through uniformly controll...

K. Crowley, Russell A McLellan, Aveek Dutta +19 more·Jan 19, 2023

Superconducting qubits are a leading system for realizing large scale quantum processors, but overall gate fidelities suffer from coherence times limited by microwave dielectric loss. Recently discovered tantalum-based qubits exhibit record lifetimes...

Pablo Antonio Moreno Casares·Jan 19, 2023

The framework of this thesis is fault-tolerant quantum algorithms. Grover's algorithm and quantum walks are described in Chapter 2. We start by highlighting the central role that rotations play in quantum algorithms, explaining Grover's, why it is op...

Victoria Zhang, P. Nation·Jan 18, 2023

We present a method for characterizing the performance of noisy quantum processors using discrete time crystals. Deviations from ideal persistent oscillatory behavior give rise to numerical scores by which relative quantum processor capabilities can ...

Frank Z. Wang·Jan 18, 2023

Quantum computing engineering integrates quantum electronic engineering and computer science required to develop quantum computer hardware and software. In this study, we used four experiments (a single spin experiment, a giant spin experiment, a nan...

Yu-Fang Chen, Kai-Min Chung, Ondřej Lengál +3 more·Jan 18, 2023

We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our approach, the problem is given by a triple {P} C {Q} and the question is whether, given a set P of quantum states on the input of a circuit C, the set of quantum s...

Chen Qian, Wei-Feng Zhuang, R. Guo +2 more·Jan 18, 2023

Variational quantum algorithms, which consist of optimal parameterized quantum circuits, are promising for demonstrating quantum advantages in the noisy intermediate-scale quantum (NISQ) era. Apart from classical computational resources, different ki...

A. Maksymov, Jason H. V. Nguyen, Y. Nam +1 more·Jan 18, 2023

Large quantum computers promise to solve some critical problems not solvable otherwise. However, modern quantum technologies suffer various imperfections such as control errors and qubit decoherence, inhibiting their potential utility. The overheads o...

Xiongzhi Zeng, Yi Fan, Jie Liu +2 more·Jan 18, 2023

The variational quantum eigensolver is a promising way to solve the Schrödinger equation on a noisy intermediate-scale quantum (NISQ) computer, while its success relies on a well-designed wave function ansatz. Inspired by the quantum neural network, ...

Chao Fang, Ye Wang, Ke-jia Sun +1 more·Jan 18, 2023

The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally inefficient, often le...