Fp -Linear and Fpm-Linear Qudit Codes From Dual-Containing Classical Codes

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 […]

One-Dimensional Lazy Quantum Walk in Ternary System

Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional lazy quantum walk in the ternary quantum domain and show its equivalence for circuit realization in ternary quantum logic. Using an appropriate logical mapping of the position space on which a walker evolves […]

Survey on Quantum Circuit Compilation for Noisy Intermediate-Scale Quantum Computers: Artificial Intelligence to Heuristics

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 […]

Cryogenic Floating-Gate CMOS Circuits for Quantum Control

Voltage biases are often required to bias Qubits, and yet applying a static bias requires separate chip wires, dramatically increasing the system complexity. An ideal approach would be having a nonvolatile digital or analog memory to avoid these issues. This article shows floating-gate (FG) structures could be used to set and forget potentials and tunnel […]

Exploiting Symmetry Reduces the Cost of Training QAOA

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 […]

Rydberg Atom Electric Field Sensors for Communications and Sensing

Rydberg atom electric field sensors are projected to enable novel capabilities for resilient communications and sensing. This quantum sensor is small-size, highly sensitive, and broadly tunable, and it has the potential for performing precision vector electric field and angle-of-arrival measurements. While these atomic electric field sensors will not replace traditional receivers in commodity applications for […]

Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement

In this article, we extend variational quantum optimization algorithms for quadratic unconstrained binary optimization problems to the class of mixed binary optimization problems. This allows us to combine binary decision variables with continuous decision variables, which, for instance, enables the modeling of inequality constraints via slack variables. We propose two heuristics and introduce the transaction […]

Variational Learning for Quantum Artificial Neural Networks

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 […]

Distributed Quantum Computing and Network Control for Accelerated VQE

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 […]

On the Stochastic Analysis of a Quantum Entanglement Distribution Switch

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 […]