Qubit Archives - Page 6 of 11 - IEEE Transactions on Quantum Engineering

Timing Constraints Imposed by Classical Digital Control Systems on Photonic Implementations of Measurement-Based Quantum Computing

November 2, 2022John R. ScottOpen Access, Special Section on Classical Control SystemsComputer architecture, Control systems, Logic gates, Photonics, Quantum computing, Qubit, Timing

Most of the architectural research on photonic implementations of measurement-based quantum computing (MBQC) has focused on the quantum resources involved in the problem with the implicit assumption that these will provide the main constraints on system scaling. However, the “flying-qubit” architecture of photonic MBQC requires specific timing constraints that need to be met by the […]

Hybrid Classical-Quantum Optimization Techniques for Solving Mixed-Integer Programming Problems in Production Scheduling

June 29, 2022Akshay Ajagekar; Kumail Al Hamoud; Fengqi YouOpen Access, Quantum InformationAnnealing, Computers, Job shop scheduling, Optimal scheduling, Processor scheduling, Quantum annealing, Qubit

Quantum computing (QC) holds great promise to open up a new era of computing and has been receiving significant attention recently. To overcome the performance limitations of near-term QC, utilizing the current quantum computers to complement classical techniques for solving real-world problems is of utmost importance. In this article, we develop QC-based solution strategies that […]

Quantum Volume in Practice: What Users Can Expect From NISQ Devices

June 23, 2022Elijah Pelofske; Andreas Bärtschi; Stephan EidenbenzOpen Access, Quantum InformationBenchmark testing, Computers, Error analysis, Logic gates, Measurement, Optimization, Qubit

Quantum volume (QV) has become the de-facto standard benchmark to quantify the capability of noisy intermediate-scale quantum (NISQ) devices. While QV values are often reported by NISQ providers for their systems, we perform our own series of QV calculations on 24 NISQ devices currently offered by IBM Q, IonQ, Rigetti, Oxford Quantum Circuits, and Quantinuum […]

The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers

June 16, 2022YOSHINORI AONO; SITONG LIU; TOMOKI TANAKA; SHUMPEI UNO; RODNEY VAN METER; NAOYUKI SHINOHARA; RYO NOJIMAOpen Access, Quantum InformationComputers, Cryptography, Logic gates, Noise level, Quantum circuit, Quantum computing, Qubit

The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of […]

A Connection-Oriented Entanglement Distribution Design in Quantum Networks

May 20, 2022Jian Li; Qidong Jia; Kaiping Xue; David S. L. Wei; Nenghai YuOpen Access, Quantum InformationProtocols, Quality of service, Quantum entanglement, Quantum networks, Qubit, Routing, Teleportation

Quantum networks create a completely new way for communication, and the most important function of a quantum network is to generate long-distance quantum entanglement to serve a number of quantum applications. As the scale of the network expands, in order to establish end-to-end entanglement between two remote nodes, entangled pairs need to be generated and […]

Timing Constraints Imposed by Classical Digital Control Systems on Photonic Implementations of Measurement-Based Quantum Computing

May 19, 2022John R. Scott; Krishna C. BalramOpen Access, Quantum InformationComputer architecture, Control systems, Logic gates, Photonics, Quantum computing, Qubit, Timing

A Distributed Learning Scheme for Variational Quantum Algorithms

May 16, 2022Yuxuan Du; Yang Qian; Xingyao Wu; Dacheng TaoOpen Access, Quantum InformationOptimization, Quantum algorithm, Quantum circuit, Quantum computing, Qubit, Task analysis, Training

Variational quantum algorithms (VQAs) are prime contenders to gain computational advantages over classical algorithms using near-term quantum machines. As such, many endeavors have been made to accelerate the optimization of modern VQAs in past years. To further improve the capability of VQAs, here, we propose a quantum distributed optimization scheme (dubbed as QUDIO), whose back […]

Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees

April 19, 2022Mohammad Ghaderibaneh; Caitao Zhan; Himanshu Gupta; C. R. RamakrishnanOpen Access, Quantum InformationDegradation, Photonics, Quantum entanglement, Quantum networks, Quantum state, Qubit, Teleportation

Quantum network communication is challenging, as the no-cloning theorem in the quantum regime makes many classical techniques inapplicable; in particular, the direct transmission of qubit states over long distances is infeasible due to unrecoverable errors. For the long-distance communication of unknown quantum states, the only viable communication approach (assuming local operations and classical communications) is […]

DQRA: Deep Quantum Routing Agent for Entanglement Routing in Quantum Networks

February 7, 2022Linh Le; Tu N. NguyenOpen Access, Quantum InformationNeural networks, Quantum entanglement, Quantum networks, Qubit, Repeaters, Routing, Teleportation

Quantum routing plays a key role in the development of the next-generation network system. In particular, an entangled routing path can be constructed with the help of quantum entanglement and swapping among particles (e.g., photons) associated with nodes in the network. From another side of computing, machine learning has achieved numerous breakthrough successes in various […]

Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm

October 15, 2021Gayathree M. Vinod; Anil ShajiOpen Access, Quantum InformationProgram processors, Quantum computing, Qubit, Registers, Search problems

Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover’s search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high probability for several cases and are illustrated for the cases involving two variables for both 3- and 4-bit numbers. Methods are defined for […]