Partial trace is a very important mathematical operation in quantum mechanics. It is not only helpful in studying the subsystems of a composite quantum system but also used in computing a vast majority of quantum entanglement measures. Calculating partial trace becomes computationally very intensive with increasing number of qubits as the Hilbert space dimension increases exponentially. In this paper, we discuss about our new method of partial tracing which is based on set theory and it is more efficient. The proposed method of partial tracing overcomes all the limitations of the other well-known methods such as being computationally intensive and being limited to low dimensional Hilbert spaces. We give a detailed theoretical description of our method and also provide an explicit example of the computation. The merits of the new method and other key ideas are discussed.
Partial trace is a very important mathematical operation in quantum mechanics. It is not only helpful in studying the subsystems of a composite quantum system but also used in computing a vast majority of quantum entanglement measures. Calculating partial trace becomes computationally very intensive with increasing number of qubits as the Hilbert space dimension increases exponentially. In this paper, we discuss about our new method of partial tracing which is based on set theory and it is more efficient. The proposed method of partial tracing overcomes all the limitations of the other well-known methods such as being computationally intensive and being limited to low dimensional Hilbert spaces. We give a detailed theoretical description of our method and also provide an explicit example of the computation. The merits of the new method and other key ideas are discussed.
It is not in the scope of this elementary textbook to introduce quantum mechanics in detail or to provide an elaborate mathematical background required for quantum computing. However, we will provide some basic ideas that are essential for us to proceed further. To be precise, here we will briefly describe vector space, different types of operators, Gram-Schmidt procedure, postulates of quantum mechanics, POVM, density operator, entanglement and its measures, partial trace, Schmidt decomposition, Bloch sphere, nocloning theorem, etc. Let us start our journey toward the world of quantum computation by reviewing some simple ideas of algebra.
Mathematical theory of infinite dimensional Hilbert spaces and the theory of operator algebras acting in such spaces (or C algebras in a more abstract approach) provide a standard setting for the formulation of modern quantum mechanics. On the other hand, experimental and theoretical progress achieved in the field of quantum information theory in the last two decades has indicated the practical and technological importance of low-dimensional quantum systems, where only a few basic modes play a significant role. Such modes can often be effectively decoupled from the rest of the system and controlled separately, providing physical realizations of qubits, qutrits and other basic information carriers. Regardless of concrete physical realization, be it photon polarization, electron or nuclear spin, charge in Josephson junctions to name just a few, the mathematical description of such systems requires only finite-dimensional Hilbert space language and finite-dimensional matrix algebras. Such structures are in principle computationally manageable in sharp contrast to the infinite dimensional ones.
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.
As interest in quantum computing evolves, consideration must be given to the development of new methods to improve the current design of quantum computers. Such ideas are not only helping the advance towards practical quantum computation applications, but are also providing clearer understanding of quantum computation itself. Eventually, several new exploratory efforts to increase the efficiency beyond the inherent advantage of quantum computational systems to classical systems will materialize. As a part of these exploration efforts, this paper presents a modified version of the qubit, which we refer to as a "Qubit", that allows a smaller number of Qubits than qubits to reach the same result in applications such as Shor’s algorithm for the factorization of large numbers. The current model of the qubit consists of a quantum bit with two states, a zero and a one in a quantum superposition state. The Qubit, which consists of more than two states, is introduced and explained. A mathematical analysis of the Qubit within Hilbert space is given. We present examples of applications of the Qubit to several quantum computing algorithms, including discussion of the advantages and disadvantages that are involved. Finally a physical model to construct such a Qubit is considered.
The partial trace operation is usually considered in composite quantum systems, to reduce the state on a single subsystem. This operation has a key role in the decoherence effect and quantum measurements. However, partial trace operations can be defined in more generic situations. In particular, it can be used to restrict a quantum state (for a single or several quantum entities) on a specific region of space, the rest of the universe being treated as an environment. The reduced state is then interpreted as the state that can be detected by an ideal probe with a limited spatial extent. In this paper, such an operation is investigated for systems defined on a Fock Hilbert space. A generic expression of the reduced density matrix is computed, and it is applied to several case studies: eigenstates of the number operator, coherent states, and thermal states. These states admit very different behaviors. In particular, (i) a decoherence effect happens on eigenstates of the number operator (ii) coherent or thermal states remain coherent or thermal, but with an amplitude/temperature reduced non-trivially by the overlap between the field and the region of interest.