arXiv subjects

Mark Byrd

Publications and source records attributed to Mark Byrd.

At least 19 recordsLinked to original sources

arXiv2025

An Interacting System and Environment with Prior Correlations Plus Local Operations Can Mimic Uncorrelated Evolution

Initial system-environment correlations can induce reduced dynamics that depart from the standard completely positive (CP) description. We study when such dynamics can be reproduced by the same global unitary acting on an initial system-environment product state. We show that local preprocessing on the system, applied prior to the joint evolution, can lead to dynamics which are completely positive. We focus on two-qubit system-environment states, with a three-qubit extension when a single ancilla is used to implement Kraus channel preprocessing. We analyze three classes of local operations$-$measurements, unitaries, and Kraus channels$-$and characterize their ability to satisfy dynamics matching while minimally perturbing the initial system state. Local measurements can always enforce dynamics matching but necessarily reduce state fidelity. We numerically investigated local unitary preprocessing. Local unitaries enforce dynamics matching in all tested instances and typically preserve the system state: in 402 numerical cases the average fidelity is 99.8%, more than 92% of cases exceed 99% fidelity, and the minimum fidelity is 94.2%. We show that a two-term Kraus channel, realizable with a single ancillary qubit coupled to the system, achieves dynamics matching with unit fidelity in all tested cases. As a second contribution, we demonstrate that local preprocessing can prevent the emergence of non--completely positive (NCP) reduced dynamics in a time-dependent setting. For a correlated two-qubit experiment with a time-dependent global unitary U(t), the induced compatibility domain is fixed by the initial correlations. For every t in a nontrivial continuous interval, the reduced dynamics are NCP when defined over this domain. We then show that a single, time-independent local unitary applied prior to the joint evolution renders the reduced dynamics CP over the entire interval.

quant-ph↗

arXiv2025

Quantum Resource Correction

Resource theories play a crucial role in characterizing states and properties essential for quantum information processing. A significant challenge is protecting resources from errors. We explore strategies for correcting quantum resources. We show that resource preserving operations in resource theory define a gauge freedom on code spaces, which allows for recovery strategies that can correct the resource while changing non-essential properties. This allows decoding to be simplified. The results are applicable to various resource theories and we provide an application to quantum sensing.

quant-ph↗

arXiv2025

Physically motivated decompositions of single-qutrit gates

Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take advantage of the additional levels, a parameterization of unitary transformations in terms of experimentally realizable operations is needed. Many parameterizations of unitary 3 * 3 matrices (U(3)) exist. One decomposition of a general unitary matrix can be expressed as the product of an exponential of a diagonal matrix and an exponential of an off-diagonal matrix. This decomposition is relevant for controlling superconducting qutrits using fixed-frequency resonant control pulses. This decomposition is numerically confirmed to allow the parameterization of any element in U(3). It is shown that a simple setting of parameter ranges of parameters can easily lead to an over-parameterization, in the sense that several different sets of values for the parameters produce the same element in U(3). This fact is demonstrated using the Walsh-Hadamard (WH) matrix as an example, which is also a special qutrit gate of practical interest. The different decompositions are shown to be related, and the relationships between them are presented using general methods. The shortest path needed for the implementation of a qutrit gate is found. Other parameterizations obtained by other analytic means, which can be advantageous for various reasons, are also discussed.

quant-ph↗

arXiv2023

Fault Tolerant Quantum Error Mitigation

Typically, fault-tolerant operations and code concatenation are reserved for quantum error correction due to their resource overhead. Here, we show that fault tolerant operations have a large impact on the performance of symmetry based error mitigation techniques. We also demonstrate that similar to results in fault tolerant quantum computing, code concatenation in fault-tolerant quantum error mitigation (FTQEM) can exponentially suppress the errors to arbitrary levels. For a family of circuits, we provide analytical error thresholds for FTQEM with the repetition code. These circuits include a set of quantum circuits that can generate all of reversible classical computing. The post-selection rate in FTQEM can also be increased by correcting some of the outcomes. Our threshold results can also be viewed from the perspective of quantifying the number of gate operations we can delay checking the stabilizers in a concatenated code before errors overwhelm the encoding. The benefits of FTQEM are demonstrated with numerical simulations and hardware demonstrations.

quant-ph↗

arXiv2023

Some Entanglement Survives Most Measurements

To prepare quantum states and extract information, it is often assumed that one can perform a perfectly projective measurement. Such measurements can achieve an uncorrelated system and environment state. However, perfectly projective measurements can be difficult or impossible to perform in practice. We investigate the limitations of repeated non-projective measurements in preparing a quantum system. For an $n$-qubit system initially entangled with its environment and subsequently prepared with measurements, using a sequence of weak measurements, we show that some entanglement remains unless one of the measurement operators becomes perfectly projective through an extreme limiting process. Removing initial (unentangled) correlations between a system and its environment and the scenario where measurement outcomes are not tracked are also discussed. We present results for $n$-qubit and $n$-dimensional input states.

quant-ph↗

arXiv2022

Identifying Quantum Correlations Using Explicit SO(3) to SU(2) Maps

Quantum state manipulation of two-qubits on the local systems by special unitaries induces special orthogonal rotations on the Bloch spheres. An exact formula is given for determining the local unitaries for some given rotation on the Bloch sphere. The solution allows for easy manipulation of two-qubit quantum states with a single definition that is programmable. With this explicit formula, modifications to the correlation matrix are made simple. Using our solution, it is possible to diagonalize the correlation matrix without solving for the parameters in SU(2) that define the local unitary that induces the special orthogonal rotation in SO(3). Since diagonalization of the correlation matrix is equivalent to diagonalization of the interaction Hamiltonian, manipulating the correlation matrix is important in time-optimal control of a two-qubit state. The relationship between orthogonality conditions on SU(2) and SO(3) are given and manipulating the correlation matrix when only one qubit can be accessed is discussed.

quant-ph↗

arXiv2021

Guaranteeing Completely Positive Quantum Evolution

In open quantum systems, it is known that if the system and environment are in a product state, the evolution of the system is given by a linear completely positive (CP) Hermitian map. CP maps are a subset of general linear Hermitian maps, which also include non completely positive (NCP) maps. NCP maps can arise in evolutions such as non-Markovian evolution, where the CP divisibility of the map (writing the overall evolution as a composition of CP maps) usually fails. Positive but NCP maps are also useful as entanglement witnesses. In this paper, we focus on transforming an initial NCP map to a CP map through composition with the asymmetric depolarizing map. We use separate asymmetric depolarizing maps acting on the individual subsystems. Previous work have looked at structural physical approximation (SPA), which is a CP approximation of a NCP map using a mixture of the NCP map with a completely depolarizing map. We prove that the composition can always be made CP without completely depolarizing in any direction. It is possible to depolarize less in some directions. We give the general proof by using the Choi matrix and an isomorphism from a maximally entangled two qudit state to a set of qubits. We also give measures that describe the amount of disturbance the depolarization introduces to the original map. Given our measures, we show that asymmetric depolarization has many advantages over SPA in preserving the structure of the original NCP map. Finally, we give some examples. For some measures and examples, completely depolarizing (while not necessary) in some directions can give a better approximation than keeping the depolarizing parameters bounded by the required depolarization if symmetric depolarization is used.

quant-ph↗

arXiv2021

Detecting Initial System-Environment Correlations in Open Systems

Correlations between a system and its environment lead to errors in an open quantum system. Detecting those correlations would be valuable for avoiding and/or correcting those errors. Here we show that we can detect correlations by only measuring the system itself if we know the cause of the interaction between the two, for example in the case of a dipole-dipole interaction. We investigate the unitary $U$ which is associated with the exchange Hamiltonian and examine the ability to detect initial correlations between a system and its environment for various types of initial states. The states we select are motivated by realistic experimental conditions and we provide bounds for when we can state with certainty that there are initial system-environment correlations given experimental data.

quant-ph↗

arXiv2016

An adiabatic Leakage Elimination Operator in experimental framework

Adiabatic evolution is used in a variety of quantum information processing tasks. However, the elimination of errors is not as well-developed as it is for circuit model processing. Here, we present a strategy to accelerate a reliable quantum adiabatic process by adding Leakage Elimination Operators (LEO) to the evolution which are a sequence of pulse controls acting in an adiabatic subspace. Using the Feshbach $PQ$ partitioning technique, we obtain an analytical solution which traces the footprint of the target eigenstate. The effectiveness of the LEO is independent of the specific form of the pulse but depends on the average frequency of the control function. Furthermore, we give the exact expression of the control function in an experimental framework by a counter unitary transformation, thus the physical meaning of the LEO is clear. Our results reveal the equivalence of the control function between two different formalisms which aids in implementation.

quant-ph↗

arXiv2015

Accurate Modeling of Reduced-State Dynamics

In this paper we return to the problem of reduced-state dynamics in the presence of an interacting environment. The question we investigate is how to appropriately model a particular system evolution given some knowledge of the system-environment interaction. When the experimenter takes into account certain known features of the interaction such as its invariant subspaces or its non-local content, it may not be possible to consistently model the system evolution over a certain time interval using a standard Stinespring dilation, which assumes the system and environment to be initially uncorrelated. Simple examples demonstrating how restrictions can emerge are presented below. When the system and environment are qubits, we completely characterize the set of unitaries that always generate reduced dynamics capable of being modeled using a consistent Stinespring dilation. Finally, we show how any initial correlations between the system and environment can be certified by observing the system transformation alone during certain joint evolutions.

quant-ph↗

arXiv2015

Relative performance of ancilla verification and decoding in the [[7,1,3]] Steane code

Ancilla post-selection is a common means of achieving fault-tolerance in quantum error-correction. However, it can lead to additional data errors due to movement or wait operations. Alternatives to post-selection may achieve lower overall failure rates due to avoiding such errors. We present numerical simulation results comparing the logical error rates for the fault-tolerant [[7,1,3]] Steane code using techniques of ancilla verification vs. the newer method of ancilla decoding, as described in [D.P. DiVincenzo and P. Aliferis, PRL 98, 020501 (2007)]. We simulate QEC procedures in which rhe possibility of ancilla verification failures requires the creation and storage of additional ancillas and/or additional waiting of the data until a new ancilla can be created. We find that the decoding method, which avoids verification failures, is advantageous in terms of overall error rate in various cases, even when measurement operations are no slower than others. We analyze the effect of different classes of physical error on the relative performance of these two methods.

quant-ph↗

arXiv2015

Optimizing the Frequency of Quantum Error Correction using the [[7,1,3]] Steane Code

A common assumption in analyses of error thresholds and quantum computing in general is that one applies fault-tolerant quantum error correction (FTQEC) after every gate. This, however, is known not to always be optimal if the FTQEC procedure itself can introduce errors. We investigate the effect of varying the number of logical gates between FTQEC operations, and in particular the case where failure of a postselection condition in FTQEC may cause FTQEC to be skipped with high probability. By using a simplified model of errors induced in FTQEC, we derive an expression for the logical error rate as a function of error-correction frequency, and show that in this model the optimal frequency is relatively insensitive to postselection failure probability for a large range of such probabilities. We compare the model to data derived from Monte Carlo simulation for the $[[7,1,3]]$ Steane code.

quant-ph↗

arXiv2014

Nonperturbative Leakage Elimination Operators and Control of a Three-Level System

Dynamical decoupling operations have been shown to reduce errors in quantum information processing. Leakage from an encoded subspace to the rest of the system space is a particularly serious problem for which leakage elimination operators (LEO) were introduced. These are a particular type of decoupling which are designed to eliminate such leakage errors. Here, we provide an analysis of non-ideal pulses, rather than the well-understood ideal pulses or bang-bang controls. We show that under realistic conditions for experiments these controls will provide protection from errors. Furthermore, we find that the effect of LEOs depends exclusively on the integral of the pulse sequence in the time domain with proper ratio of pulse duration time and its period. When these two key parameters are chosen within certain bounds, leakage errors of the open system (exemplified by a three-level system for the nitrogen-vacancy centers under external magnetic field) would be dramatically decreased. The results are illustrated by the fidelity dynamics of LEO sequences, ranging from regular rectangular pulses, random pulses and even disordered (noisy) pulses.

quant-ph↗

arXiv2014

Fault-tolerance against loss for photonic FTQEC

In general, fault-tolerant quantum error correction (FTQEC) procedures are designed to detect, correct, and be fault-tolerant against errors occurring within the qubit subspace. But in some qubit implementations, additional "leakage" errors can occur in which the system leaves this subspace, and standard FTQEC procedures may not be fault-tolerant against such errors. Generic methods for achieving fault-tolerance against leakage are costly in terms of resources. In this paper we demonstrate that for a leakage model common to many photonic gate implementations, FTQEC can be implemented with far fewer additional operations than in the generic case.

quant-ph↗

arXiv2013

Minimal noise subsystems

The existence of a decoherence-free subspace/subsystem (DFS) requires that the noise possesses a symmetry. In this work we consider noise models in which perturbations break this symmetry, so that the DFS for the unperturbed model experiences noise. We ask whether in this case there exist subspaces/subsystems that have less noise than the original DFS. We develop a numerical method to search for such minimal noise subsystems and apply it to a number of examples. For the examples we examine, we find that if the perturbation is local noise then there is no better subspace/subsystem than the original DFS. We also show that if the noise model remains collective, but is perturbed in a way that breaks the symmetry, then the minimal noise subsystem is distinct from the original DFS, and improves upon it.

quant-ph↗

arXiv2013

Numerical method for finding decoherence-free subspaces and its applications

In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel. We prove that this algorithm will work for all cases with probability one, and it is more efficient than the algorithm proposed by Holbrook, Kribs, and Laflamme [Quant. Inf. Proc. 80, 381 (2003)]. In fact, our results reveal that this previous algorithm only works for special cases. As an application, we discuss how this method can be applied to increase the efficiency of an optimization procedure for finding an approximate DFS.

quant-ph↗

arXiv2010

Perfect Function Transfer in two- and three- dimensions without initialization

We find analytic models that can perfectly transfer, without state initializati$ or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. We elaborate on a possible implementation of state transfer through bosonic or fermionic atoms trapped in optical lattices. A significant finding is that the state of a spin qubit can be perfectly transferred through a fermionic system. Families of Hamiltonians, both linear and nonlinear, are described which are related to the linear Boson model and that enable the perfect transfer of arbitrary functions. This includes entangled states such as decoherence-free subsystems enabling noise protection of the transferred state.

quant-ph↗

arXiv1998

Density Matrices and Geometric Phases for n-state Systems

An explicit parameterization is given for the density matrices for $n$-state systems. The geometry of the space of pure and mixed states and the entropy of the $n$-state system is discussed. Geometric phases can arise in only specific subspaces of the space of all density matrices. The possibility of obtaining nontrivial abelian and nonabelian geometric phases in these subspaces is discussed.

quant-ph↗