QuantumInformation.jl—A Julia package for numerical computation in quantum information theory

Abstract

Numerical investigations are an important research tool in quantum information theory. There already exists a wide range of computational tools for quantum information theory implemented in various programming languages. However, there is little effort in implementing this kind of tools in the language. is a modern programming language designed for numerical computation with excellent support for vector and matrix algebra, extended type system that allows for implementation of elegant application interfaces and support for parallel and distributed computing. is a new quantum information theory library implemented in that provides functions for creating and analyzing quantum states, and for creating quantum operations in various representations. An additional feature of the library is a collection of functions for sampling random quantum states and operations such as unitary operations and generic quantum channels.

Optimal representation of quantum channels

“…Our analytical results are accompanied by functions written in the Julia language which decompose a given quantum channel in our basis. This implementation is now a part of the QuantumInformation.jl package [5,6].…”

“…The second part we present the example of whereas the last part presents the implementation of this example in the Julia language. This implementation is now a part of the QuantumInformation.jl [5,6] numerical library available on-line at https:// github.com/iitis/QuantumInformation.jl. Surprisingly, despite the complex mathematical structure and quite technical proofs, the implementation is relatively simple and therefore useful.…”

Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design

“…However, a batched register in Yao be conveniently converted to a reduced density matrix. By porting Yao with QuantumInformation.jl [99], one can carry out noisy simulation with density matrices. One can find a blog in Appendix I.…”

“…The circuit ansatz (general_U4) is the minimal universal two-qubit gate decomposition of Ref. [86] • Porting Yao to QuantumInformation [99]…”

Discrimination of POVMs with rank-one effects

“…We sample N = 10 6 pairs of random POVMs in a manner explained at the beginning of this section. For further details on sampling, we refer the reader to [27,28].…”