Scalable distributed gate-model quantum computers

  title={Scalable distributed gate-model quantum computers},
  author={Laszlo Gyongyosi and S{\'a}ndor Imre},
  journal={Scientific Reports},
A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from small-scale quantum devices to large-scale quantum computers. Here, we define a model of scalable distributed gate-model quantum computation in near-term quantum systems of the NISQ (noisy intermediate scale quantum) technology era. We prove that the proposed architecture can maximize an objective function of a… 
Distributed quantum computation for near-term quantum environments
This work defines a scalable distributed model of gate-model quantum computation in near-term quantum systems that can be scaled up to large-scale quantum computers.
Secret Sharing Based Multiparty Quantum Computation for Multiplication
This paper proposes a secret sharing based quantum protocol for (t, n) threshold secure multiparty multiplication, where t out of n players can compute the multiplication efficiently with low cost.
Resource optimization for the quantum Internet
Methods and procedures of resource prioritization and resource balancing for the quantum Internet are defined to optimize the resource allocation mechanisms and to reduce the resource consumptions of the network entities.
A quantum-logic gate between two optical photons with an efficiency above 40%
Optical qubits uniquely combine information transfer in optical fibres with a good processing capability and are therefore attractive tools for quantum technologies [1–4]. A large challenge, however,
Quantum-Logic Gate between Two Optical Photons with an Average Efficiency above 40%
Optical qubits uniquely combine information transfer in optical fibers with a good processing capability and are therefore attractive tools for quantum technologies. A large challenge, however, is to
Compact entanglement sources for portable quantum information platforms
We discuss two novel entanglement sources utilizing spontaneous parametric downconversion in periodically poled waveguides. Using quasi-phase matched KTP crystals, we have demonstrated a
Comparison of the similarity between two quantum images
Three quantum algorithms for comparing the similarity between two quantum images are presented for the first time and achieve exponential acceleration than the existing quantum and classical methods in all three cases.
Hybrid quantum investment optimization with minimal holding period
In this paper we propose a hybrid quantum-classical algorithm for dynamic portfolio optimization with minimal holding period. Our algorithm is based on sampling the near-optimal portfolios at each
A Quantum-Inspired Sperm Motility Algorithm
The two proposed algorithms are global convergence guaranteed population-based optimization algorithms, which outperform the original SMA in terms of their search-ability and have fewer parameters to control.
Fundamental Physics and Computation: The Computer-Theoretic Framework
The central goal of this manuscript is to survey the relationships between fundamental physics and computer science. We begin by providing a short historical review of how different concepts of


Circuit Depth Reduction for Gate-Model Quantum Computers
The complexity of the quantum algorithm and the achievable reduction in circuit depth are proved and the method provides a tractable solution to reduce the time complexity and physical layer costs of quantum computers.
Unsupervised Quantum Gate Control for Gate-Model Quantum Computers
A method for the unsupervised control of quantum gates in near-term quantum computers is defined and it is proved that the non-stable quantum gate becomes controllable via a machine learning method if the quantum gates formulate an entangled gate structure.
Decoherence dynamics estimation for superconducting gate-model quantum computers
  • L. Gyongyosi
  • Physics, Computer Science
    Quantum Inf. Process.
  • 2020
This work proposes an algorithm for the optimal placement of the quantum computational blocks of gate-model quantum circuits and studies the effects of capacitance interference on the distribution of the Gaussian noise in the Josephson energy.
State stabilization for gate-model quantum computers
A method for the stabilization of an optimal quantum state of a quantum computer through an arbitrary number of running sequences and a procedure to classify the stabilized quantum states of the quantum computer into stability classes are proposed.
Quantum Computing in the NISQ era and beyond
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away - but it should be regarded as a significant step toward the more powerful quantum technologies of the future.
A Survey on quantum computing technology
Quantum computational supremacy
This work presents the leading proposals to achieve quantum supremacy, and discusses how to reliably compare the power of a classical computer to thePower of a quantum computer.
Functional Quantum Nodes for Entanglement Distribution over Scalable Quantum Networks
The demonstrated quantum nodes and channels can be used as segments of a quantum repeater, providing an essential tool for robust long-distance quantum communication.
Quantum circuit design for objective function maximization in gate-model quantum computers
A method for designing quantum circuits for gate-model quantum computers and the aim of QTAM is to determine an optimal reduced topology for the quantum circuits in the hardware layer at the maximization of the objective function of an arbitrary computational problem are demonstrated.
Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
This work presents a scheme of a quantum repeater that connects a string of (imperfect) entangled pairs of particles by using a novel nested purification protocol, thereby creating a single distant pair of high fidelity.