The reliable provision of entangled qubits is an essential precondition in a variety of schemes for distributed quantum computing. This is challenged by multiple nuisances, such as errors during the transmission over quantum links, but also due to degradation of the entanglement over time due to decoherence. The latter can be seen as a constraint […]
Modern cloud/edge architectures need to orchestrate multiple layers of heterogeneous computing nodes, including pervasive sensors/actuators, distributed edge/fog nodes, centralized data centers, and quantum devices. The optimal assignment and scheduling of computation on the different nodes is a very difficult problem, with NP-hard complexity. In this article, we explore the possibility of solving this problem with […]
Grover adaptive search (GAS) is a quantum exhaustive search algorithm designed to solve binary optimization problems. In this article, we propose higher order binary formulations that can simultaneously reduce the numbers of qubits and gates required for GAS. Specifically, we consider two novel strategies: one that reduces the number of gates through polynomial factorization, and […]
Quantum information cannot be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred to as quantum cloning, and quantum teleportation. Quantum telecloning allows approximate copies of quantum information to be constructed by separate parties, using the classical results of a Bell measurement made on […]
Multiobjective optimization is a ubiquitous problem that arises naturally in many scientific and industrial areas. Network routing optimization with multiobjective performance demands falls into this problem class, and finding good quality solutions at large scales is generally challenging. In this work, we develop a scheme with which near-term quantum computers can be applied to solve […]
We implement a simulation of a quantum field theory in 1+1 space–time dimensions on a gate-based quantum computer using the light-front formulation of the theory. The nonperturbative simulation of the Yukawa model field theory is verified on IBM’s simulator and is also demonstrated on a small-scale IBM circuit-based quantum processor, on the cloud, using IBM […]
In this article, we propose a postprocessing variationally scheduled quantum algorithm (pVSQA) for solving constrained combinatorial optimization problems (COPs). COPs are typically transformed into ground-state search problems of the Ising model on a quantum annealer or gate-based quantum device. Variational methods are used to find an optimal schedule function that leads to high-quality solutions in […]
This article introduces a process framework for debugging quantum circuits, focusing on three distinct types of circuit blocks: amplitude–permutation, phase-modulation, and amplitude–redistribution circuit blocks. Our research addresses the critical need for specialized debugging approaches tailored to the unique properties of each circuit type. For amplitude–permutation circuits, we propose techniques to correct amplitude–permutations mimicking classical operations. […]
This article introduces a process framework for debugging quantum circuits, focusing on three distinct types of circuit blocks: amplitude–permutation, phase-modulation, and amplitude–redistribution circuit blocks. Our research addresses the critical need for specialized debugging approaches tailored to the unique properties of each circuit type. For amplitude–permutation circuits, we propose techniques to correct amplitude–permutations mimicking classical operations. […]
Recently, quantum computing has been proven as an ideal theory for the design of fuzzy inference engines, thanks to its capability to efficiently solve the rule explosion problem. In this scenario, a quantum fuzzy inference engine (QFIE) was proposed as a quantum algorithm able to generate an exponential computational advantage over conventional fuzzy inference engines. […]