Computers Archives - Page 4 of 4 - IEEE Transactions on Quantum Engineering

Distributed Quantum Computing and Network Control for Accelerated VQE

February 9, 2021Stephen DiAdamo; Marco Ghibaudi; James CruiseOpen Access, Quantum Computer Architecture, Quantum InformationComputers, Control systems, Hardware, Logic gates, Quantum algorithm, Quantum computing, Qubit

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

Formulating and Solving Routing Problems on Quantum Computers

January 6, 2021Stuart Harwood; Claudio Gambella; Dimitar Trenev; Andrea Simonetto; David Bernal; Donny GreenbergOpen Access, Quantum Computer Architecture, Quantum InformationComputers, Mathematical model, Optimization, Quantum algorithm, Quantum computing, Routing, Vehicle routing

The determination of vehicle routes fulfilling connectivity, time, and operational constraints is a well-studied combinatorial optimization problem. The NP-hard complexity of vehicle routing problems has fostered the adoption of tailored exact approaches, matheuristics, and metaheuristics on classical computing devices. The ongoing evolution of quantum computing hardware and the recent advances of quantum algorithms (i.e., VQE, […]

Finding Small and Large k-Clique Instances on a Quantum Computer

December 18, 2020Sara Ayman Metwalli; François Le Gall; Rodney Van MeterOpen Access, Quantum Computer Architecture, Quantum InformationComputers, Hamming weight, Hilbert space, Logic gates, Quantum computing, Qubit, Time complexity

Algorithms for triangle finding, the smallest nontrivial instance of the k -clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM. In this article, we present a practical gate-based approach to both the triangle-finding problem and its NP-hard k -clique generalization. We examine both constant factors for near-term implementation […]

Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers

October 23, 2020Claudio Gambella; Andrea SimonettoOpen Access, Quantum Computer Architecture, Quantum InformationComputational modeling, Computers, Convergence, Convex functions, Noise measurement, Optimization, Quantum computing

Solving combinatorial optimization problems on current noisy quantum devices is currently being advocated for (and restricted to) binary polynomial optimization with equality constraints via quantum heuristic approaches. This is achieved using, for example, the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA). In this article, we present a decomposition-based approach to extend […]

Quantum Computing for Finance: State-of-the-Art and Future Prospects

October 13, 2020Daniel J. Egger; Claudio Gambella; Jakub Marecek; Scott McFaddin; Martin Mevissen; Rudy Raymond; Andrea Simonetto; Stefan Woerner; Elena YndurainOpen Access, Quantum Information, Quantum SoftwareBanking, Computers, Insurance, Quantum mechanics, Qubit

This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in finance that are computationally challenging classically and for which quantum computing algorithms are promising. In the main part, we […]