Searcharxiv⌕ Search

arXiv subjects

J. A. Miszczak

Publications and source records attributed to J. A. Miszczak.

18 recordsLinked to original sources

Geometrical versus time-series representation of data in quantum control learning

Recently machine learning techniques have become popular for analysing physical systems and solving problems occurring in quantum computing. In this paper we focus on using such techniques for finding the sequence of physical operations implementing the given quantum logical operation. In this context we analyse the flexibility of the data representation and compare the applicability of two machine learning approaches based on different representations of data. We demonstrate that the utilization of the geometrical structure of control pulses is sufficient for achieving high-fidelity of the implemented evolution. We also demonstrate that artificial neural networks, unlike geometrical methods, posses the generalization abilities enabling them to generate control pulses for the systems with variable strength of the disturbance. The presented results suggest that in some quantum control scenarios, geometrical data representation and processing is competitive to more complex methods.

quant-ph↗

Approximation of quantum control correction scheme using deep neural networks

We study the functional relationship between quantum control pulses in the idealized case and the pulses in the presence of an unwanted drift. We show that a class of artificial neural networks called LSTM is able to model this functional relationship with high efficiency, and hence the correction scheme required to counterbalance the effect of the drift. Our solution allows studying the mapping from quantum control pulses to system dynamics and then analysing the robustness of the latter against local variations in the control profile.

quant-ph↗

States and channels in quantum mechanics without complex numbers

In the presented note we aim at exploring the possibility of abandoning complex numbers in the representation of quantum states and operations. We demonstrate a simplified version of quantum mechanics in which the states are represented using real numbers only. The main advantage of this approach is that the simulation of the $n$-dimensional quantum system requires $n^2$ real numbers, in contrast to the standard case where $n^4$ real numbers are required. The main disadvantage is the lack of hermicity in the representation of quantum states. Using Mathematica computer algebra system we develop a set of functions for manipulating real-only quantum states. With the help of this tool we study the properties of the introduced representation and the induced representation of quantum channels.

physics.comp-ph↗

Generalized open quantum walks on Apollonian networks

We introduce the model of generalized open quantum walks on networks using the Transition Operation Matrices formalism. We focus our analysis on the mean first passage time and the average return time in Apollonian networks. These results differ significantly from a classical walk on these networks. We show a comparison of the classical and quantum behaviour of walks on these networks.

quant-ph↗

RandFile package for Mathematica for accessing file-based sources of randomness

We present a package for Mathematica computer algebra system which allows the exploitation of local files as sources of random data. We provide the description of the package and illustrate its usage by showing some examples. We also compare the provided functionality with alternative sources of randomness, namely a built-in pseudo-random generator and the package for accessing hardware true random number generators.

physics.comp-ph↗

0-th quantization or quantum (information) theory in 42 minutes

We present a concise introduction of basic concepts in quantum information theory and quantum mechanics prepared as an introduction for a general audience. In our approach the rules of quantum mechanics are presented in a simple form of rules describing the method of constructing quantum objects corresponding to classical objects. As a byproduct of the introduced approach, we present some alternative rules and use them to describe basic ingredients of quantum information theory using different types of objects.

quant-ph↗

Employing online quantum random number generators for generating truly random quantum states in Mathematica

We present a new version of TRQS package for Mathematica computing system. The package allows harnessing quantum random number generators (QRNG) for investigating the statistical properties of quantum states. It implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum random number generator service and implements new functions for retrieving lists of random numbers. Thanks to the introduced improvements, the new version provides faster access to high-quality sources of random numbers and can be used in simulations requiring large amount of random data.

physics.comp-ph↗

Models of quantum computation and quantum programming languages

The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations.

cs.PL↗

Generating and using truly random quantum states in Mathematica

The problem of generating random quantum states is of a great interest from the quantum information theory point of view. In this paper we present a package for Mathematica computing system harnessing a specific piece of hardware, namely Quantis quantum random number generator (QRNG), for investigating statistical properties of quantum states. The described package implements a number of functions for generating random states, which use Quantis QRNG as a source of randomness. It also provides procedures which can be used in simulations not related directly to quantum information processing.

quant-ph↗

Singular value decomposition and matrix reorderings in quantum information theory

We review Schmidt and Kraus decompositions in the form of singular value decomposition using operations of reshaping, vectorization and reshuffling. We use the introduced notation to analyse the correspondence between quantum states and operations with the help of Jamiolkowski isomorphism. The presented matrix reorderings allow us to obtain simple formulae for the composition of quantum channels and partial operations used in quantum information theory. To provide examples of the discussed operations we utilize a package for the Mathematica computing system implementing basic functions used in the calculations related to quantum information theory.

quant-ph↗

Extending scientific computing system with structural quantum programming capabilities

We present a basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave, providing a library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for high-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices.

cs.PL↗

Sub-- and super--fidelity as bounds for quantum fidelity

We derive several bounds on fidelity between quantum states. In particular we show that fidelity is bounded from above by a simple to compute quantity we call super--fidelity. It is analogous to another quantity called sub--fidelity. For any two states of a two--dimensional quantum system (N=2) all three quantities coincide. We demonstrate that sub-- and super--fidelity are concave functions. We also show that super--fidelity is super--multiplicative while sub--fidelity is sub--multiplicative and design feasible schemes to measure these quantities in an experiment. Super--fidelity can be used to define a distance between quantum states. With respect to this metric the set of quantum states forms a part of a $N^2-1$ dimensional hypersphere.

quant-ph↗

Noise Effects in Quantum Magic Squares Game

In the article we analyse how noisiness of quantum channels can influence the magic squares quantum pseudo-telepathy game. We show that the probability of success can be used to determine characteristics of quantum channels. Therefore the game deserves more careful study aiming at its implementation.

quant-ph↗

Quantum state discrimination: a geometric approach

We analyse the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view this problem is equivalent to that of embedding a simplex of points whose distances are maximal with respect to the Bures distance (or trace distance). We derive upper and lower bounds for the trace distance and for the fidelity between two quantum states, which imply bounds for the Bures distance between the unitary orbits of both states. We thus show that when analysing minimal and maximal distances between states of fixed spectra it is sufficient to consider diagonal states only. Hence considering optimal discrimination, given freedom up to unitary orbits, it is sufficient to consider diagonal states. This is illustrated geometrically in terms of Weyl chambers.

quant-ph↗

Quantum Parrondo's game with random strategies

We present a quantum implementation of Parrondo's game with randomly switched strategies using 1) a quantum walk as a source of ``randomness'' and 2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum walk scheme.

quant-ph↗

Quantum Implementation of Parrondo's Paradox

We propose a quantum implementation of a capital-dependent Parrondo's paradox that uses $O(\log_2(n))$ qubits, where $n$ is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results.

quant-ph↗

Numerical simulations of mixed states quantum computation

We describe quantum-octave package of functions useful for simulations of quantum algorithms and protocols. Presented package allows to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations - partial trace and partial transpose. Those operations are used as building blocks of algorithms for analysis of entanglement and quantum error correction codes. Simulation of Shor's algorithm is presented as an example of package capabilities.

quant-ph↗

On entanglement at tripartite states

Article presents general formulation of entanglement measures problem in terms of correlation function. Description of entanglement in probabilistic framework allow us to introduce new quantity which describes quantum and classical correlations. This formalism is applied to calculate bipartite and tripartite correlations in two special cases of entangled states of tripartite systems.

quant-ph↗