arXiv subjects

Lane G. Gunderman

Publications and source records attributed to Lane G. Gunderman.

15 recordsLinked to original sources

arXiv2026

Mixed-register Stabilizer Codes: A Coding-theoretic Perspective

Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure of realistic quantum hardware, but also has some possibly enticing foundational strengths. While work in the past has largely focused on protecting information in quantum devices with locations that are some consistent local structure, this work considers coding-theoretic constraints on devices constructed from locations which may vary in their local structures -- these are mixed-register quantum devices. In this work we provide some general results for mixed-register Pauli operators, then identify some stabilizer encoded information forms that are forbidden. Building on these insights, we construct coding-theoretically optimal mixed-register stabilizer codes from sets of codes defined on coprime local-dimensions. The construction of such codes results in codes with logical subspaces that do not directly correspond to any of the constituent local-dimensions.

quant-ph↗

arXiv2025

New local stabilizer codes from local classical codes

Amongst quantum error-correcting codes the surface code has remained of particular promise as it has local and very low-weight checks, even despite only encoding a single logical qubit no matter the lattice size. In this work we discuss new local and low-weight stabilizer codes which are obtained from the recent progress in $2D$ local classical codes. Of note, we construct codes with weight and qubit use count of $5$ while being able to protect the information with high distance, or greater logical count. We also consider the Fibonacci code family which generates weight and qubit use count of $6$ while having parameters $[[O(l^3),O(l),Ω(l)]]$. While other weight-reduction methods centered on lowering the weight without regard to locality, this work achieves very low-weight and geometric locality. This work is exhaustive over translated classical generators of size $3\times 3$ and up to size $17\times 17$ classical bit grids.

quant-ph↗

arXiv2025

Beyond Integral-Domain Stabilizer Codes

Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems, however, largely the case of composite number of levels in the system has been avoided. This relative absence is due to the underlying ring theoretic tools required for analyzing such systems. Here we explore composite local-dimension quantum stabilizer codes, providing a pair of constructions for transforming known stabilizer codes into valid ones for composite local-dimensions. In addition remarks on logical encodings and the counts possible are discussed. This work lays out central methods for working with composite dimensional systems, enabling full use of the computational space of some systems, and expanding the understanding of the symplectic spaces involved.

quant-ph↗

arXiv2024

Thermal state structure in the Tavis--Cummings model and rapid simulations in mesoscopic quantum ensembles

Hybrid quantum systems consisting of a collection of N spin-1/2 particles uniformly interacting with an electromagnetic field, such as one confined in a cavity, are important for the development of quantum information processors and will be useful for metrology, as well as tests of collective behavior. Such systems are often modeled by the Tavis-Cummings model and having an accurate understanding of the thermal behaviors of this system is needed to understand the behavior of them in realistic environments. We quantitatively show in this work that the Dicke subspace approximation is at times invoked too readily, in specific we show that there is a temperature above which the degeneracies in the system become dominant and the Dicke subspace is minimally populated. This transition occurs at a lower temperature than priorly considered. When in such a temperature regime, the key constants of the motion are the total excitation count between the spin system and cavity and the collective angular momentum of the spin system. These enable perturbative expansions for thermal properties in terms of the energy shifts of dressed states, called Lamb shifts herein. These enable efficient numeric methods for obtaining certain parameters that scale as $O(\sqrt{N})$, and is thus highly efficient. These provide methods for approximating, and bounding, properties of these systems as well as characterizing the dominant population regions, including under perturbative noise. In the regime of stronger spin-spin coupling the perturbations outweigh the expansion series terms and inefficient methods likely are needed to be employed, removing the computational efficiency of simulating such systems. The results in this work can also be used for related systems such as coupled-cavity arrays, cavity mediated coupling of collective spin ensembles, and collective spin systems.

quant-ph↗

arXiv2024

Weight Reduced Stabilizer Codes with Lower Overhead

Stabilizer codes are the most widely studied class of quantum error-correcting codes and form the basis of most proposals for a fault-tolerant quantum computer. A stabilizer code is defined by a set of parity-check operators, which are measured in order to infer information about errors that may have occurred. In typical settings, measuring these operators is itself a noisy process and the noise strength scales with the number of qubits involved in a given parity check, or its weight. Hastings proposed a method for reducing the weights of the parity checks of a stabilizer code, though it has previously only been studied in the asymptotic regime. Here, we instead focus on the regime of small-to-medium size codes suitable for quantum computing hardware. We provide both a fully explicit description of Hastings's method and propose a substantially simplified weight reduction method that is applicable to the class of quantum product codes. Our simplified method allows us to reduce the check weights of hypergraph and lifted product codes to at most six, while preserving the number of logical qubits and at least retaining (in fact often increasing) the code distance. The price we pay is an increase in the number of physical qubits by a constant factor, but we find that our method is much more efficient than Hastings's method in this regard. We benchmark the performance of our codes in a photonic quantum computing architecture based on GKP qubits and passive linear optics, finding that our weight reduction method substantially improves code performance.

quant-ph↗

arXiv2024

Stabilizer Codes with Exotic Local-dimensions

Traditional stabilizer codes operate over prime power local-dimensions. In this work we extend the stabilizer formalism using the local-dimension-invariant setting to import stabilizer codes from these standard local-dimensions to other cases. In particular, we show that any traditional stabilizer code can be used for analog continuous-variable codes, and consider restrictions in phase space and discretized phase space. This puts this framework on an equivalent footing as traditional stabilizer codes. Following this, using extensions of prior ideas, we show that a stabilizer code originally designed with a finite field local-dimension can be transformed into a code with the same $n$, $k$, and $d$ parameters for any integral domain. This is of theoretical interest and can be of use for systems whose local-dimension is better described by mathematical rings, which permits the use of traditional stabilizer codes for protecting their information as well.

quant-ph↗

arXiv2024

Minimal qubit representations of Hamiltonians via conserved charges

In the last years, we have been witnessing a tremendous push to demonstrate that quantum computers can solve classically intractable problems. This effort, initially focused on the hardware, progressively included the simplification of the models to be simulated. We consider Hamiltonians written in terms of Pauli operators and systematically cut all qubits that are not essential to simulate the system. Our approach is universally applicable and lowers the complexity by first ensuring that the largest possible portion of the Hilbert space becomes irrelevant, and then by finding and exploiting all conserved charges of the system, i.e., symmetries that can be expressed as Pauli operators. Remarkably, both processes are classically efficient and optimal. To showcase our algorithm, we simplify chemical molecules, lattice gauge theories, the Hubbard and the Kitaev models.

quant-ph↗

arXiv2022

Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers

Transformations which convert between Fermionic modes and qubit operations have become a ubiquitous tool in quantum algorithms for simulating systems. Similarly, collections of Pauli operators might be obtained from solutions of non-local games and satisfiability problems. Drawing on ideas from entanglement-assisted quantum error-correcting codes and quantum convolutional codes, we prove the obtainable lower-bound for the number of qubits needed to represent such Pauli operations which are equivalent and provide a procedure for determining such a set of minimal register Pauli operations.

quant-ph↗

arXiv2021

Degenerate Local-dimension-invariant Stabilizer Codes and an Alternative Bound for the Distance Preservation Condition

One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and in particular that degenerate stabilizer codes can have their distance also promised upon sufficiently large local-dimension, as well as a new bound on the local-dimension required to preserve the distance of local-dimension-invariant codes, which is a result which could prove to be useful for error-corrected qudit quantum computers.

quant-ph↗

arXiv2021

Local-dimension-invariant Calderbank-Shor-Steane Codes with an Improved Distance Promise

Quantum computers will need effective error-correcting codes. Current quantum processors require precise control of each particle, so having fewer particles to control might be beneficial. Although traditionally quantum computers are considered as using qubits (2-level systems), qudits (systems with more than 2-levels) are appealing since they can have an equivalent computational space using fewer particles, meaning fewer particles need to be controlled. In this work we prove how to construct codes with parameters $[[2^N,2^N-1-2N,\geq 3]]_q$ for any choice of prime $q$ and natural number $N$. This is accomplished using the technique of local-dimension-invariant (LDI) codes. Generally LDI codes have the drawback of needing large local-dimensions to ensure the distance is at least preserved, and so this work also reduces this requirement by utilizing the structure of CSS codes, allowing for the aforementioned code family to be imported for any local-dimension choice.

quant-ph↗

arXiv2021

Changing the Local-Dimension of an Entanglement-Assisted Stabilizer Code Removes Entanglement Need

Having protected quantum information is essential to perform quantum computations. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and in particular this procedure removes the need for shared entanglement in entanglement-assisted quantum error-correcting codes, which is a result which could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.

quant-ph↗

arXiv2021

Generalized Collective Lamb Shift

Hybrid quantum systems consisting of an ensemble of two--level systems interacting with a single--mode electromagnetic field are important for the development of quantum information processors and other quantum devices. These systems are characterized by the set of energy level hybridizations, split by collective Lamb shifts, that occur when the ensemble and field mode interact coherently with high cooperativity. Computing the full set of Lamb shifts is generally intractable given the high dimensionality of many devices. In this work, we present a set of techniques that allow a compact description of the Lamb shift statistics across all collective angular momentum subspaces of the ensemble without using restrictive approximations on the state space. We use these techniques to both analyze the Lamb shift in all subspaces and excitation manifolds and to describe the average observed Lamb shift weighted over the degeneracies of all subspaces.

quant-ph↗

arXiv2020

Local Dimension Invariant Qudit Stabilizer Codes

Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between parameters. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.

quant-ph↗

arXiv2019

Recursive Quantum Qudit Convolutional Codes Need Not be Catastrophic

Classical turbo codes efficiently approach the Shannon limit, and so bringing these over to the quantum scenario would allow for rapid transmission of quantum information. Early on in the work of defining the quantum analogue, it was shown that an efficient recursive subroutine (quantum convolutional codes) would always be catastrophic. This result may have stunted the further research into this coding scheme. In this document, we prove that this previously proven no-go theorem is no longer always true if we extend the coding scheme into qudit space with dimension some prime larger than 2. This removes a blockade in the development of quantum turbo codes and hopefully will stimulate further research in this area.

quant-ph↗

arXiv2019

Transforming Particular Stabilizer Codes into Hybrid Codes

In this paper, we prove how to extend a subset of quantum stabilizer codes into a qudit hybrid code storing $\log_2 p$ classical bits over a qudit space with dimension $p$, with $p$ prime. Our proof also gives an explicit procedure for finding the entire collection of stabilizer algebras for all of the subcodes of the hybrid code. This allows extra classical information to be transmitted without having to arduously search for additional codes and their associated codewords, and also provides a first lower bound to the amount of classical information able to be transmitted in a qudit hybrid code, but unfortunately only allows for $\log_2 p$ classical bits to be decoded by a receiver.

quant-ph↗