Variational Quantum Eigensolvers in the Era of Distributed Quantum Computers

• URL: http://arxiv.org/abs/2302.14067v1
• Date: Mon, 27 Feb 2023 19:00:01 GMT
• Title: Variational Quantum Eigensolvers in the Era of Distributed Quantum Computers
• Authors: Ilia Khait, Edwin Tham, Dvira Segal, Aharon Brodutch
• Abstract summary: We show that a distributed quantum computing architecture with it limited capacity to exchange information between modules can accurately solve quantum computational problems. Results provide a strong indication that near-term it modular quantum processors can be an effective alternative to their monolithic counterparts.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The computational power of a quantum computer is limited by the number of qubits available for information processing. Increasing this number within a single device is difficult; it is widely accepted that distributed modular architectures are the solution to large scale quantum computing. The major challenge in implementing such architectures is the need to exchange quantum information between modules. In this work, we show that a distributed quantum computing architecture with {\it limited} capacity to exchange information between modules can accurately solve quantum computational problems. Using the example of a variational quantum eignesolver with an ansatz designed for a two-module (dual-core) architecture, we show that three inter-module operations provide a significant advantage over no inter-module (or serially executed) operations. These results provide a strong indication that near-term {\it modular} quantum processors can be an effective alternative to their monolithic counterparts.

Related papers

• Distributed Quantum Computing in Silicon [40.16556091789959]
  We present preliminary demonstrations of some key distributed quantum computing protocols on silicon T centres in isotopically-enriched silicon. We demonstrate the distribution of entanglement between modules and consume it to apply a teleported gate sequence.
  arXiv  Detail & Related papers  (2024-06-03T18:02:49Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Mapping quantum algorithms to multi-core quantum computing architectures [1.8602413562219944]
  Multi-core quantum computer architecture poses new challenges such as expensive inter-core communication. A detailed critical discussion of the quantum circuit mapping problem for multi-core quantum computing architectures is provided. We further explore the performance of a mapping method, which is formulated as a partitioning over time graph problem.
  arXiv  Detail & Related papers  (2023-03-28T16:46:59Z)
• Modularized and scalable compilation for quantum program in double quantum dots [0.0]
  We train the Ansatz circuit and exemplarily realize high-fidelity compilation of a series of universal quantum gates for singlet-triplet qubits in semiconductor double quantum dots. Our work constitutes an important stepping-stone for exploiting the potential of this physical resource for advanced and complicated quantum algorithms.
  arXiv  Detail & Related papers  (2022-11-10T02:32:39Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation [3.8221353389253676]
  We introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large optimization problems onto distributed quantum architectures. This is achieved through the combined use of graph partitioning and quantum circuit cutting. We simulate the QDCA on instances of the Maximum Independent Set problem and find that it is able to outperform similar classical algorithms.
  arXiv  Detail & Related papers  (2021-07-15T18:00:32Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Exploring a Double Full-Stack Communications-Enabled Architecture for Multi-Core Quantum Computers [0.0]
  We propose a double full-stack architecture encompassing quantum computation and quantum communications. Using behavioral models and actual measurements from existing quantum computers, the results of simulations suggest that multi-core architectures may effectively unleash the full quantum computer potential.
  arXiv  Detail & Related papers  (2020-09-17T09:58:26Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.