We describe the [Formula: see text] package of functions useful for simulations of quantum algorithms and protocols. The presented package allows one 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. A simulation of Shor's algorithm is presented as an example of package capabilities.
We describe the [Formula: see text] package of functions useful for simulations of quantum algorithms and protocols. The presented package allows one 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. A simulation of Shor's algorithm is presented as an example of package capabilities.
Article presents package of functions for GNU Octave computer algebra system. Those functions were designed to perform simple but not necessary efficient simulations of quantum systems, especially quantum computers. The most important feature of this package is the ability to perform calculations with mixed states.We describe application of quantum-octave package for simulation of Grovers algorithm, which is one of the most important quantum algorithms. We also list other possible calculations, which can be performed with this package.
Quantum computing has emerged as a powerful paradigm capable of addressing computational problems beyond the reach of classical machines. Numerical tech- niques play a crucial role in the simulation, analysis, and optimization of quantum systems and algorithms. This chapter presents an original and systematic discussion of numerical methods used in quantum computing, including numerical linear al- gebra, simulation of quantum dynamics, variational optimization techniques, noise modeling, and error mitigation. The chapter is written with a pedagogical approach and is intended for postgraduate students, researchers, and academicians.
Taking partial traces (PTrs) for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this paper, we present a thorough description of this function and analyze the number of elementary operations (ops) needed, under some possible alternative implementations, to compute it on a classical computer. As we note, it is worthwhile doing some analytical developments in order to avoid making null multiplications and sums, what can considerably reduce the ops. For instance, for a bipartite system [Formula: see text] with dimensions [Formula: see text] and [Formula: see text] and for [Formula: see text], while a direct use of PTr definition applied to [Formula: see text] requires [Formula: see text] ops, its optimized implementation entails [Formula: see text] ops. In the sequence, we regard the computation of PTrs for general multipartite systems and describe Fortran code provided to implement it numerically. We also consider the calculation of reduced density matrices via Bloch’s parametrization with generalized Gell Mann’s matrices.
This study considers implementations of error correction in a simulation language on a classical computer. Error correction will be necessarily in quantum computing and quantum information. We will give some examples of the implementations of some error correction codes. These implementations will be made in a more general quantum simulation language on a classical computer in the language Mathematica. The intention of this research is to develop a programming language that is able to make simulations of all quantum algorithms and error corrections in the same framework. The program code implemented on a classical computer will provide a connection between the mathematical formulation of quantum mechanics and computational methods. This gives us a clear uncomplicated language for the implementations of algorithms.
In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.
In this paper, we investigate the inertia (i.e. the eigenvalue triplet counting negative, zero, and positive eigenvalues) of entanglement witnesses arising from the partial transposes of non-positive partial transpose (NPT) states across bipartite ([Formula: see text] and [Formula: see text]) and tripartite (three-qubit) systems. For any [Formula: see text] NPT state [Formula: see text] whose partial transpose [Formula: see text] has inertia [Formula: see text], we prove that [Formula: see text] can be converted into a [Formula: see text] NPT subsystem via stochastic local operations and classical communication (SLOCC). For any [Formula: see text] NPT state [Formula: see text] whose partial transpose [Formula: see text] has inertia [Formula: see text], we prove that [Formula: see text] can always be projected into a [Formula: see text] NPT subsystem via local operations. Through extensive numerical simulations generating random sparse positive semidefinite matrices, we catalog all possible inertia trios [Formula: see text] for three-qubit NPT states. We identify 72 distinct inertia trios, revealing asymmetric distributions and co-occurrence constraints. These findings establish fundamental links between inertia patterns, distillability properties, and the geometric structure of entangled states, providing new spectral tools for characterizing entanglement in quantum information processing.