This dissertation has two main parts. The first part deals with questions relating to Haghverdi and Scott's notion of partially traced categories. The main result is a representation theorem for such categories: we prove that every partially traced category can be faithfully embedded in a totally traced category. Also conversely, every monoidal subcategory of a totally traced category is partially traced, so this characterizes the partially traced categories completely. The main technique we use is based on Freyd's paracategories, along with a partial version of Joyal, Street, and Verity's Int construction. Along the way, we discuss some new examples of partially traced categories, mostly arising in the context of quantum computation. The second part deals with the construction of categorical models of higher-order quantum computation. We construct a concrete semantic model of Selinger and Valiron's quantum lambda calculus, which has been an open problem until now. We do this by considering presheaf categories over appropriate base categories arising from first-order quantum computation. The main technical ingredients are Day's convolution theory and Kelly and Freyd's notion of continuity of functors. We first give an abstract description of the properties required of the base categories for the model construction to work; then exhibit a specific example of base categories satisfying these properties.This dissertation has two main parts. The first part deals with questions relating to Haghverdi and Scott's notion of partially traced categories. The main result is a representation theorem for such categories: we prove that every partially traced category can be faithfully embedded in a totally traced category. Also conversely, every monoidal subcategory of a totally traced category is partially traced, so this characterizes the partially traced categories completely. The main technique we use is based on Freyd's paracategories, along with a partial version of Joyal, Street, and Verity's Int construction. Along the way, we discuss some new examples of partially traced categories, mostly arising in the context of quantum computation. The second part deals with the construction of categorical models of higher-order quantum computation. We construct a concrete semantic model of Selinger and Valiron's quantum lambda calculus, which has been an open problem until now. We do this by considering presheaf categories over appropriate base categories arising from first-order quantum computation. The main technical ingredients are Day's convolution theory and Kelly and Freyd's notion of continuity of functors. We first give an abstract description of the properties required of the base categories for the model construction to work; then exhibit a specific example of base categories satisfying these properties.

arXiv:1301.5087Jan 1, 201011 citations

A set theoretical approach for the partial tracing operation in quantum mechanics

Pranay Barkataki, M. S. Ramkarthik

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.

arXiv:1709.06346International Journal of Quantum InformationSep 1, 20181 citation

The buried trace

Yun Li

Nature PhysicsOct 1, 20190 citations

Estimation of trace distance between two arbitrary quantum states

Sanchita Ghosh, Anumita Mukhopadhyay, Anindita Bera +2 more

When it comes to discriminating between two quantum states, trace distance is one of the well-known metrics used in quantum computation and quantum information theory. While there are several quantum algorithms for calculating the trace distance between two quantum states, computing it for any two general density matrices remains computationally demanding. In this paper, we propose a quantum algorithm based on the exponentiation of the density matrix and the improved quantum phase estimation (IQPE) to determine the trace distance for both pure and mixed states, with a time complexity of $O(N^2/\varepsilon^6)$ where $N$ is the number of qubits of the given states and $\varepsilon$ is the simulation or estimation precision error. We demonstrate its ability to predict the quantity with proof-of-principle simulations and also quantum hardware computations on the IBM quantum computers, confirming its promise for near-term quantum devices.When it comes to discriminating between two quantum states, trace distance is one of the well-known metrics used in quantum computation and quantum information theory. While there are several quantum algorithms for calculating the trace distance between two quantum states, computing it for any two general density matrices remains computationally demanding. In this paper, we propose a quantum algorithm based on the exponentiation of the density matrix and the improved quantum phase estimation (IQPE) to determine the trace distance for both pure and mixed states, with a time complexity of $O(N^2/\varepsilon^6)$ where $N$ is the number of qubits of the given states and $\varepsilon$ is the simulation or estimation precision error. We demonstrate its ability to predict the quantity with proof-of-principle simulations and also quantum hardware computations on the IBM quantum computers, confirming its promise for near-term quantum devices.

quant-pharXiv:2604.05628Apr 8, 20260 citations

O(N^2/\varepsilon^6)

where

N

is the number of qubits of the given states and

\varepsilon

is the simulation or estimation precision error. We demonstrate its ability to predict the quantity with proof-of-principle simulations and also quantum hardware computations on the IBM quantum computers, confirming its promise for near-term quantum devices.