As quantum network technologies develop, the need for teaching and engineering tools such as simulators and emulators rises. QuNetSim addresses this need. QuNetSim is a Python software framework that delivers an easy-to-use interface for simulating quantum networks at the network layer, which can be extended at little effort of the user to implement the corresponding […]
As a wide variety of quantum computing platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance. Inspired by the success of single-qubit error rate computations for tracking the progress of gate-based quantum computers, this work proposes a quantum annealing single-qubit assessment (QASA) protocol for quantifying […]
Quantumnetworking is emerging as a new research area to explore the opportunities of interconnecting quantum systems through end-to-end entanglement of qubits at geographical distance via quantum repeaters. A promising architecture has been proposed in the literature that decouples entanglement between adjacent quantum nodes/repeaters from establishing end-to-end paths by adopting a time slotted approach. Within this […]
Existing protocols for benchmarking current quantum coprocessors fail to meet the usual standards for assessing the performance of high-performance-computing platforms. After a synthetic review of these protocols—whether at the gate, circuit, or application level—we introduce a new benchmark, dubbed Atos Q-score, which is application-centric, hardware-agnostic, and scalable to quantum advantage processor sizes and beyond. The […]
Quantum code construction from two classical codes D1[n,k1,d1] and D2[n,k2,d2] over the field Fpm ( p is prime and m is an integer) satisfying the dual containing criteria D⊥1⊂D2 using the Calderbank–Shor–Steane (CSS) framework is well-studied. We show that the generalization of the CSS framework for qubits to qudits yields two different classes of codes, namely, the Fp -linear CSS codes and the well-known Fpm -linear CSS codes based on the […]
Computationally expensive applications, including machine learning, chemical simulations, and financial modeling, are promising candidates for noisy intermediate scale quantum (NISQ) computers. In these problems, one important challenge is mapping a quantum circuit onto NISQ hardware while satisfying physical constraints of an underlying quantum architecture. Quantum circuit compilation (QCC) aims to generate feasible mappings such that […]
A promising approach to the practical application of the quantum approximate optimization algorithm (QAOA) is finding QAOA parameters classically in simulation and sampling the solutions from QAOA with optimized parameters on a quantum computer. Doing so requires repeated evaluations of QAOA energy in simulation. In this article, we propose a novel approach for accelerating the […]
In the past few years, quantum computing and machine learning fostered rapid developments in their respective areas of application, introducing new perspectives on how information processing systems can be realized and programmed. The rapidly growing field of quantum machine learning aims at bringing together these two ongoing revolutions. Here, we first review a series of […]
In this article, we study a quantum entanglement distribution switch that serves k users in a star topology. We model variants of the system as continuous-time Markov chains and obtain expressions for switch capacity, expected number of qubits stored in memory at the switch, and the quantum memory occupancy distribution. We obtain a number of analytic results […]
Interconnecting small quantum computers will be essential in the future for creating large-scale, robust quantum computers. Methods for distributing monolithic quantum algorithms efficiently are, thus, needed. In this article, we consider an approach for distributing the accelerated variational quantum eigensolver algorithm over arbitrary sized—in terms of number of qubits—distributed quantum computers. We consider approaches for […]