arXiv subjects

David Kribs

Publications and source records attributed to David Kribs.

15 recordsLinked to original sources

arXiv2025

Quasiorthogonality of Commutative Algebras, Complex Hadamard Matrices, and Mutually Unbiased Measurements

We deepen the theory of quasiorthogonal and approximately quasiorthogonal operator algebras through an analysis of the commutative algebra case. We give a new approach to calculate the measure of orthogonality between two such subalgebras of matrices, based on a matrix-theoretic notion we introduce that has a connection to complex Hadamard matrices. We also show how this new tool can yield significant information on the general non-commutative case. We finish by considering quasiorthogonality for the important subclass of commutative algebras that arise from mutually unbiased bases (MUBs) and mutually unbiased measurements (MUMs) in quantum information theory. We present a number of examples throughout the work, including a subclass that arises from group algebras and Latin squares.

math.QA↗

arXiv2021

NISQ: Error Correction, Mitigation, and Noise Simulation

Error-correcting codes were invented to correct errors on noisy communication channels. Quantum error correction (QEC), however, may have a wider range of uses, including information transmission, quantum simulation/computation, and fault-tolerance. These invite us to rethink QEC, in particular, about the role that quantum physics plays in terms of encoding and decoding. The fact that many quantum algorithms, especially near-term hybrid quantum-classical algorithms, only use limited types of local measurements on quantum states, leads to various new techniques called Quantum Error Mitigation (QEM). This work examines the task of QEM from several perspectives. Using some intuitions built upon classical and quantum communication scenarios, we clarify some fundamental distinctions between QEC and QEM. We then discuss the implications of noise invertibility for QEM, and give an explicit construction called Drazin-inverse for non-invertible noise, which is trace preserving while the commonly-used Moore-Penrose pseudoinverse may not be. Finally, we study the consequences of having an imperfect knowledge about the noise, and derive conditions when noise can be reduced using QEM.

quant-ph↗

arXiv2019

Vector Representations of Graphs and Distinguishing Quantum Product States with One-way LOCC

Distinguishing sets of quantum states shared by two parties using only local operations and classical communication measurements is a fundamental topic in quantum communication and quantum information theory. We introduce a graph-theoretic approach, based on the theory of vector representations of graphs, to the core problem of distinguishing product states with one-way LOCC. We establish a number of results that show how distinguishing such states can be framed in terms of properties of the underlying graphs associated with a set of vector product states. We also present a number of illustrative examples.

quant-ph↗

arXiv2018

Experimental Implementation of Efficient Quantum Pseudorandomness on a 12-spin System

Quantum pseudorandomness, also known as unitary designs, comprise a powerful resource for quantum computation and quantum engineering. While it is known in theory that pseudorandom unitary operators can be constructed efficiently, realizing these objects in realistic physical systems can be a challenging task. In this work, we study quantum pseudorandomness generation on a 12-spin nuclear magnetic resonance system. The experimental process is based on the recently proposed design Hamiltonian approach, which has the merit of being significantly more efficient than previous protocols. By applying random refocusing sequences to the experimental system we create a design Hamiltonian the dynamics of which quickly forms unitary designs. We then use multiple-quantum techniques to measure spreading of quantum coherences over system's degrees of freedom, and so to probe the growth of quantum pseudorandomness. The measured multiple-quantum coherence spectra indicate that substantial quantum pseudorandomness have been achieved.

quant-ph↗

arXiv2018

Quantum Error Correction and One-Way LOCC State Distinguishability

We explore the intersection of studies in quantum error correction and quantum local operations and classical communication (LOCC). We consider one-way LOCC measurement protocols as quantum channels and investigate their error correction properties, emphasizing an operator theory approach to the subject, and we obtain new applications to one-way LOCC state distinguishability as well as new derivations of some established results. We also derive conditions on when states that arise through the stabilizer formalism for quantum error correction are distinguishable under one-way LOCC.

quant-ph↗

arXiv2016

Operator Structures and Quantum One-Way LOCC Conditions

We conduct the first detailed analysis in quantum information of recently derived operator relations from the study of quantum one-way local operations and classical communications (LOCC). We show how operator structures such as operator systems, operator algebras, and Hilbert C*-modules all naturally arise in this setting, and we make use of these structures to derive new results and new derivations of some established results in the study of LOCC. We also show that perfect distinguishability under one-way LOCC and under arbitrary operations is equivalent for several families of operators that appear jointly in matrix and operator theory and quantum information theory.

quant-ph↗

arXiv2016

Quantum State and Process Tomography via Adaptive Measurements

We investigate quantum state tomography (QST) for pure states and quantum process tomography (QPT) for unitary channels via $adaptive$ measurements. For a quantum system with a $d$-dimensional Hilbert space, we first propose an adaptive protocol where only $2d-1$ measurement outcomes are used to accomplish the QST for $all$ pure states. This idea is then extended to study QPT for unitary channels, where an adaptive unitary process tomography (AUPT) protocol of $d^2+d-1$ measurement outcomes is constructed for any unitary channel. We experimentally implement the AUPT protocol in a 2-qubit nuclear magnetic resonance system. We examine the performance of the AUPT protocol when applied to Hadamard gate, $T$ gate ($π/8$ phase gate), and controlled-NOT gate, respectively, as these gates form the universal gate set for quantum information processing purpose. As a comparison, standard QPT is also implemented for each gate. Our experimental results show that the AUPT protocol that reconstructing unitary channels via adaptive measurements significantly reduce the number of experiments required by standard QPT without considerable loss of fidelity.

quant-ph↗

arXiv2016

Pure State Tomography with Pauli Measurements

We examine the problem of finding the minimum number of Pauli measurements needed to uniquely determine an arbitrary $n$-qubit pure state among all quantum states. We show that only $11$ Pauli measurements are needed to determine an arbitrary two-qubit pure state compared to the full quantum state tomography with $16$ measurements, and only $31$ Pauli measurements are needed to determine an arbitrary three-qubit pure state compared to the full quantum state tomography with $64$ measurements. We demonstrate that our protocol is robust under depolarizing error with simulated random pure states. We experimentally test the protocol on two- and three-qubit systems with nuclear magnetic resonance techniques. We show that the pure state tomography protocol saves us a number of measurements without considerable loss of fidelity. We compare our protocol with same-size sets of randomly selected Pauli operators and find that our selected set of Pauli measurements significantly outperforms those random sampling sets. As a direct application, our scheme can also be used to reduce the number of settings needed for pure-state tomography in quantum optical systems.

quant-ph↗

arXiv2015

Private Quantum Subsystems and Quasiorthogonal Operator Algebras

We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the $n$-qubit Pauli group, which exist in the absence of private subspaces. In doing so, we also connect these quantum privacy investigations with the theory of quasiorthogonal operator algebras through the use of tools from group theory and operator theory.

quant-ph↗

arXiv2014

Symmetric Extension of Two-Qubit States

Quantum key distribution uses public discussion protocols to establish shared secret keys. In the exploration of ultimate limits to such protocols, the property of symmetric extendibility of underlying bipartite states $ρ_{AB}$ plays an important role. A bipartite state $ρ_{AB}$ is symmetric extendible if there exits a tripartite state $ρ_{ABB'}$, such that the $AB$ marginal state is identical to the $AB'$ marginal state, i.e. $ρ_{AB'}=ρ_{AB}$. For a symmetric extendible state $ρ_{AB}$, the first task of the public discussion protocol is to break this symmetric extendibility. Therefore to characterize all bi-partite quantum states that possess symmetric extensions is of vital importance. We prove a simple analytical formula that a two-qubit state $ρ_{AB}$ admits a symmetric extension if and only if $\tr(ρ_B^2)\geq \tr(ρ_{AB}^2)-4\sqrt{\det{ρ_{AB}}}$. Given the intimate relationship between the symmetric extension problem and the quantum marginal problem, our result also provides the first analytical necessary and sufficient condition for the quantum marginal problem with overlapping marginals.

quant-ph↗

arXiv2013

Uniqueness of Quantum States Compatible with Given Measurement Results

We discuss the uniqueness of quantum states compatible with given results for measuring a set of observables. For a given pure state, we consider two different types of uniqueness: (1) no other pure state is compatible with the same measurement results and (2) no other state, pure or mixed, is compatible with the same measurement results. For case (1), it is known that for a d-dimensional Hilbert space, there exists a set of 4d-5 observables that uniquely determines any pure state. We show that for case (2), 5d-7 observables suffice to uniquely determine any pure state. Thus there is a gap between the results for (1) and (2), and we give some examples to illustrate this. The case of observables corresponding to reduced density matrices (RDMs) of a multipartite system is also discussed, where we improve known bounds on local dimensions for case (2) in which almost all pure states are uniquely determined by their RDMs. We further discuss circumstances where (1) can imply (2). We use convexity of the numerical range of operators to show that when only two observables are measured, (1) always implies (2). More generally, if there is a compact group of symmetries of the state space which has the span of the observables measured as the set of fixed points, then (1) implies (2). We analyze the possible dimensions for the span of such observables. Our results extend naturally to the case of low rank quantum states.

quant-ph↗

arXiv2011

Ground-State Spaces of Frustration-Free Hamiltonians

We study the ground-state space properties for frustration-free Hamiltonians. We introduce a concept of `reduced spaces' to characterize local structures of ground-state spaces. For a many-body system, we characterize mathematical structures for the set $Θ_k$ of all the $k$-particle reduced spaces, which with a binary operation called join forms a semilattice that can be interpreted as an abstract convex structure. The smallest nonzero elements in $Θ_k$, called atoms, are analogs of extreme points. We study the properties of atoms in $Θ_k$ and discuss its relationship with ground states of $k$-local frustration-free Hamiltonians. For spin-1/2 systems, we show that all the atoms in $Θ_2$ are unique ground states of some 2-local frustration-free Hamiltonians. Moreover, we show that the elements in $Θ_k$ may not be the join of atoms, indicating a richer structure for $Θ_k$ beyond the convex structure. Our study of $Θ_k$ deepens the understanding of ground-state space properties for frustration-free Hamiltonians, from a new angle of reduced spaces.

quant-ph↗

arXiv2004

A Unified and Generalized Approach to Quantum Error Correction

We present a unified approach to quantum error correction, called operator quantum error correction. This scheme relies on a generalized notion of noiseless subsystems that is not restricted to the commutant of the interaction algebra. We arrive at the unified approach, which incorporates the known techniques -- i.e. the standard error correction model, the method of decoherence-free subspaces, and the noiseless subsystem method -- as special cases, by combining active error correction with this generalized noiseless subsystem method. Moreover, we demonstrate that the quantum error correction condition from the standard model is a necessary condition for all known methods of quantum error correction.

quant-ph↗

arXiv2004

The C*-envelope of the tensor algebra of a directed graph

Given an arbitrary countable directed graph $G$ we prove the C*-envelope of the tensor algebra $T_+(G)$ coincides with the universal Cuntz-Krieger algebra associated with $G$. Our approach is concrete in nature and does not rely on Hilbert module machinery. We show how our results extend to the case of higher rank graphs, where an analogous result is obtained for the tensor algebra of a row-finite $k$-graph with no sources.

math.OA↗

arXiv2004

Isomorphisms of algebras associated with directed graphs

In this paper we verify that the graph forms a complete invariant for Banach algebra isomorphisms of tensor algebras of graphs. For tensor algebras associated with countable directed graphs having no sinks the graph forms an invariant for algebraic isomorphisms as well. The graph also forms a complete invariant for w*-bicontinuous isomorphisms of free semigroupoid algebras. For free semigroupoid algebras associated with countable directed locally finite graphs with no sinks, the graph also forms an invariant for algebraic isomorphisms.

math.OA↗