Modeling of Measurement-based Quantum Network Coding on IBM Q Experience Devices

  title={Modeling of Measurement-based Quantum Network Coding on IBM Q Experience Devices},
  author={Poramet Pathumsoot and Takaaki Matsuo and Takahiko Satoh and Michal Hajduvsek and Sujin Suwanna and Rodney Van Meter},
  journal={arXiv: Quantum Physics},
Quantum network coding has been proposed to improve resource utilization to support distributed computation but has not yet been put in to practice. We investigate a particular implementation of quantum network coding using measurement-based quantum computation on IBM Q processors. We compare the performance of quantum network coding with entanglement swapping and entanglement distribution via linear cluster states. These protocols outperform quantum network coding in terms of the final Bell… 
Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices
The integrated unitary operations of an HRE quantum memory are defined, the learning procedure is proved, and the outcome of the retrieval efficiency and the output SNR (signal-to-noise ratio) are evaluated.
Scalable distributed gate-model quantum computers
It is proved that the proposed architecture can maximize an objective function of a computational problem in a distributed manner and study the impacts of decoherence on distributed objective function evaluation.
Quantum State Optimization and Computational Pathway Evaluation for Gate-Model Quantum Computers
A state determination method that finds a target system state for a quantum computer at a given target objective function value is proved and is convenient for gate-model quantum computations and the near-term quantum devices of the quantum Internet.
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.
Objective function estimation for solving optimization problems in gate-model quantum computers
The proposed solution significantly reduces the costs of the objective function estimation and provides an optimized estimate of the state of the quantum computer for solving optimization problems.
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.
Dynamics of entangled networks of the quantum Internet
A mathematical model is developed to quantify the dynamics of entangled network structures and entanglement flow in the quantum Internet and the analytical solutions determine the equilibrium states of the entangled quantum networks and characterize the stability, fluctuation attributes, and dynamics of entangled flow.
Theory of Noise-Scaled Stability Bounds and Entanglement Rate Maximization in the Quantum Internet
This work defines the term of entanglement swapping set that models the status of quantum memory of a quantum repeater with the stored density matrices and determines the optimal entangler swapping method that maximizes theEntanglement rate of the quantum repeaters at the different entanglements swapping sets as function of the noise of the local memory and local operations.


Measurement-based quantum computation on cluster states
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster
Quantum repeaters based on entanglement purification
A scheme is presented that allows entanglement purification over arbitrary long channels and tolerates errors on the percent level and requires a polynomial overhead in time, and an overhead in local resources that grows only logarithmically with the length of the channel.
Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation
This work begins by establishing a metric for choosing among possible paths and circuit alternatives for executing gates between variables placed far apart within the processor, and finds that a single-number metric describing the fidelity of individual gates is a useful but imperfect guide.
Long-Range Big Quantum-Data Transmission.
By employing hashing, a deterministic entanglement distillation protocol with one-way communication, one obtains a scalable scheme that allows one to reach arbitrary distances, with constant overhead in resources per repeater station, and ultrahigh rates.
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.
Surface code quantum communication.
It is shown that two-way communication can be avoided and quantum information can be sent over arbitrary distances with arbitrarily low error at a rate limited only by the local gate speed.
Entanglement in Graph States and its Applications
This review gives a tutorial introduction into the theory of graph states, and discusses the basic notions and properties of these states, including aspects of non-locality, bi-partite and multi- partite entanglement and its classification in terms of the Schmidt measure.
We propose a novel dynamical method for beating decoherence and dissipation in open quantum systems. We demonstrate the possibility of filtering out the effects of unwanted (not necessarily known)
  • Thomas de Quincey
  • Physics
    The Works of Thomas De Quincey, Vol. 1: Writings, 1799–1820
  • 2000
In supernova (SN) spectroscopy relatively little attention has been given to the properties of optically thick spectral lines in epochs following the photosphere’s recession. Most treatments and
Information Theory
Information TheoryPapers read at a Symposium on Information Theory held at the Royal Institution, London, August 29th to September 2nd, 1960. Edited by Colin Cherry. Pp. xi + 476. (London: