In this article, we propose a novel method of formulating an NP-hard wireless channel assignment problem as a higher-order unconstrained binary optimization (HUBO), where the Grover adaptive search (GAS) is used to provide a quadratic speedup for solving the problem. The conventional method relies on a one-hot encoding of the channel indices, resulting in a […]
Thanks to the rise of quantum computers, many variations of the variational quantum eigensolver (VQE) have been proposed in recent times. This is a promising development for real quantum algorithms, as the VQE is a promising algorithm that runs on current quantum hardware. However, the popular method of comparing your algorithm versus a classical baseline […]
Machine learning (ML) classification tasks can be carried out on a quantum computer (QC) using probabilistic quantum memory (PQM) and its extension, parametric PQM (P-PQM), by calculating the Hamming distance between an input pattern and a database of r patterns containing z features with a distinct attributes. For PQM and P-PQM to correctly compute the Hamming distance, the feature must be […]
Recent days have witnessed significant interests in applying quantum-enhanced techniques for solving a variety of machine learning tasks. Variational methods that use quantum resources of imperfect quantum devices with the help of classical computing techniques are popular for supervised learning. Variational quantum classification (VQC) is one of such methods with possible quantum advantage in using […]
In this article, we experimentally test the performance of the recently proposed domain-wall encoding of discrete variables Chancellor, 2019, on Ising model flux qubit quantum annealers. We compare this encoding with the traditional one-hot methods and find that they outperform the one-hot encoding for three different problems at different sizes of both the problem and […]
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 […]
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 […]
Quantum coding schemes over qudits using preshared entanglement between the encoder and decoder can provide better error correction capability than without it. In this article, we develop procedures for constructing encoding operators for entanglement-unassisted and entanglement-assisted qudit stabilizer codes over Fpk, with p prime and k≥1 from first principles, generalizing prior works on qubit-based codes and codes that work […]