Separation of gates in quantum parallel programming

• URL: http://arxiv.org/abs/2110.14965v1
• Date: Thu, 28 Oct 2021 09:11:41 GMT
• Title: Separation of gates in quantum parallel programming
• Authors: Kan He, Shusen Liu, Jinchuan Hou
• Abstract summary: Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming. Main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. We theoretically analyse the (sufficient and necessary) separability conditions of multipartite quantum gates in finite or infinite dimensional systems.
• Score: 1.4821822452801385
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The number of qubits in current quantum computers is a major restriction on their wider application. To address this issue, Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming ([M. S. Ying, Morgan-Kaufmann, 2016]). In doing so, the main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. In this study, we theoretically analyse the (sufficient and necessary) separability conditions of multipartite quantum gates in finite or infinite dimensional systems. We then conduct separation experiments with n-qubit quantum gates on IBM quantum computers using QSI software.

Related papers

• Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian [0.0]
  We present a practical method for implementing universal quantum computation using the transverse-field Ising Hamiltonian. Our proposal is compatible with D-Wave devices, opening up possibilities for realizing large-scale gate-based quantum computers.
  arXiv  Detail & Related papers  (2024-02-29T12:47:29Z)
• Scaling quantum computing with dynamic circuits [0.6990493129893112]
  Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits. Here we overcome these limitations with error mitigated dynamic circuits and circuit-cutting to create quantum states requiring a periodic connectivity employing up to 142 qubits.
  arXiv  Detail & Related papers  (2024-02-27T19:00:07Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Towards Distributed Quantum Computing by Qubit and Gate Graph Partitioning Techniques [1.211184870567714]
  We propose two techniques for partitioning large quantum circuits and for distribution to small quantum computers. Our techniques map a quantum circuit to a graph representation. We use the SeQUeNCe quantum communication simulator to measure the time required for generating all the entanglements required to execute the distributed circuit.
  arXiv  Detail & Related papers  (2023-10-05T23:21:18Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Quantum Algorithms and Simulation for Parallel and Distributed Quantum Computing [0.0]
  A viable approach for building large-scale quantum computers is to interlink small-scale quantum computers with a quantum network. We present our software framework called Interlin-q, a simulation platform that aims to simplify designing and verifying parallel and distributed quantum algorithms.
  arXiv  Detail & Related papers  (2021-06-12T19:41:48Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware [1.400804591672331]
  Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. We present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations.
  arXiv  Detail & Related papers  (2020-01-30T07:29:29Z)

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.