Realization of the Werner–Holevo and Landau–Streater Quantum Channels for Qutrits on Quantum Computers

@article{Pakhomchik2019RealizationOT,
  title={Realization of the Werner–Holevo and Landau–Streater Quantum Channels for Qutrits on Quantum Computers},
  author={Aleksey I. Pakhomchik and Ivan S. Feshchenko and Andreas Glatz and Valerii M. Vinokur and Alexandr V. Lebedev and Sergey N. Filippov and G. B. Lesovik},
  journal={Journal of Russian Laser Research},
  year={2019},
  volume={41},
  pages={40-53}
}
We realize the Landau–Streater (LS) and Werner–Holevo (WH) quantum channels for qutrits on IBM quantum computers. These channels correspond to the interaction between a qutrit and its environment that results in the globally unitarily covariant qutrit transformation violating the multiplicativity of the maximal p -norm. Our realization of the LS and WH channels is based on embedding the qutrit states into states of two qubits and using the single-qubit and two-qubit CNOT gates to implement the… 

The power of qutrits for non-adaptive measurement-based quantum computing

TLDR
It is proved that quantum correlations enable the computation of all ternary functions using the generalised qutrit Greenberger-Horne-Zeilinger (GHZ) state as a resource and at most 3 n − 1qutrits, which yields a corresponding generalised GHZ type paradox for any ternARY function that LHVs cannot compute.

On the convex characterisation of the set of unital quantum channels

TLDR
This paper parametrise a family of maps and through this parametrisation they provide a partial characterisation of the set of unital quantum maps with respect to this family of channels and it is seen that the parametrisedfamily of maps corresponds to maps with Kraus rank three.

References

SHOWING 1-10 OF 19 REFERENCES

Methods for analysing the quality of the element base of quantum information technologies

TLDR
The method of guaranteed estimation of quantum tomography accuracy, which implies quantitative estimation of measurement results, is described and can be used to improve the quality of logic gates of quantum computers and debug the procedures of quantum state control in quantum cryptography problems.

Algorithmic simulation of far-from-equilibrium dynamics using quantum computer

TLDR
Proof-of-principle digital simulations of two spin models are performed, which are the central spin model and the transverse-field Ising model, using 5- and 16-qubit superconducting quantum computers of the IBM Quantum Experience, and it is found that these devices are able to reproduce some important consequences of the symmetry of the initial state for the system’s subsequent dynamics, such as the excitation blockade.

Sampling and Scrambling on a Chain of Superconducting Qubits

TLDR
A circuit, the Josephson sampler, that embeds a real vector into an entangled state of n qubits, and optionally samples from it is studied, to assess its expressiveness and ability to generate Haar random unitaries and quantum chaos.

Quantum supremacy using a programmable superconducting processor

TLDR
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Quantum Mappings and Characterization of Entangled Quantum States

We review quantum mappings used in problems of characterization of entanglement of two-part and multi-particle systems. Together with positive and n-tensorial constant positive mappings, we consider

Unknown Quantum States and Operations, a Bayesian View

TLDR
Two results are motivate and review two results that generalize de Finetti's theorem to the quantum mechanical setting: a definetti theorem for quantum states and a de Fintti theorem forquantum operations.

Unital Quantum Channels – Convex Structure and Revivals of Birkhoff’s Theorem

The set of doubly-stochastic quantum channels and its subset of mixtures of unitaries are investigated. We provide a detailed analysis of their structure together with computable criteria for the

Counterexample to an additivity conjecture for output purity of quantum channels

A conjecture arising naturally in the investigation of additivity of classical information capacity of quantum channels states that the maximal purity of outputs from a quantum channel, as measured

The Theory of Open Quantum Systems

PREFACE ACKNOWLEDGEMENTS PART 1: PROBABILITY IN CLASSICAL AND QUANTUM MECHANICS 1. Classical probability theory and stochastic processes 2. Quantum Probability PART 2: DENSITY MATRIX THEORY 3.

On random unitary channels

In this paper, we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set