arXiv subjects

Felix Huber

Publications and source records attributed to Felix Huber.

At least 37 records · Page 2Linked to original sources

arXiv2024

Second order cone relaxations for quantum Max Cut

Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefinite programming relaxations have been fruitful in designing theoretical approximation algorithms for QMC, but are computationally expensive for systems beyond tens of qubits. We give a second order cone relaxation for QMC, which optimizes over the set of mutually consistent three-qubit reduced density matrices. In combination with Pauli level-$1$ of the quantum Lasserre hierarchy, the relaxation achieves an approximation ratio of $0.526$ to the ground state energy. Our relaxation is solvable on systems with hundreds of qubits and paves the way to computationally efficient lower and upper bounds on the ground state energy of large-scale quantum spin systems.

quant-ph↗

arXiv2024

Engineering holography with stabilizer graph codes

The discovery of holographic codes established a surprising connection between quantum error correction and the anti-de Sitter-conformal field theory correspondence. Recent technological progress in artificial quantum systems renders the experimental realization of such holographic codes now within reach. Formulating the hyperbolic pentagon code in terms of a stabilizer graph code, we give gate sequences that are tailored to systems with long-range interactions. We show how to obtain encoding and decoding circuits for the hyperbolic pentagon code, before focusing on a small instance of the holographic code on twelve qubits. Our approach allows to verify holographic properties by partial decoding operations, recovering bulk degrees of freedom from their nearby boundary.

quant-ph↗

arXiv2024

Positive maps from the walled Brauer algebra

We present positive maps and matrix inequalities for variables from the positive cone. These inequalities contain partial transpose and reshuffling operations, and can be understood as positive multilinear maps that are in one-to-one correspondence with elements from the walled Brauer algebra. Using our formalism, these maps can be obtained in a systematic and clear way by manipulating partially transposed permutation operators under a partial trace. Additionally, these maps are reasonably easy in construction by combining an algorithmic approach with graphical calculus.

quant-ph↗

arXiv2024

Entanglement detection with trace polynomials

We provide a systematic method for nonlinear entanglement detection based on trace polynomial inequalities. In particular, this allows to employ multi-partite witnesses for the detection of bipartite states, and vice versa. We identify witnesses for which linear detection of an entangled state fails, but for which nonlinear detection succeeds. With the trace polynomial formulation a great variety of witnesses arise from immamant inequalities, which can be implemented in the laboratory through randomized measurements.

quant-ph↗

arXiv2023

Bell inequalities with overlapping measurements

Which nonlocal correlations can be obtained, when a party has access to more than one subsystem? While traditionally nonlocality deals with spacelike separated parties, this question becomes important with quantum technologies that connect devices by means of small shared systems. Here we study Bell inequalities where measurements of different parties can have overlap. This allows to accommodate problems in quantum information such as the existence of quantum error correction codes in the framework of non-locality. The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.

quant-ph↗

arXiv2022

Dimension-free entanglement detection in multipartite Werner states

Werner states are multipartite quantum states that are invariant under the diagonal conjugate action of the unitary group. This paper gives a complete characterization of their entanglement that is independent of the underlying local Hilbert space: for every entangled Werner state there exists a dimension-free entanglement witness. The construction of such a witness is formulated as an optimization problem. To solve it, two semidefinite programming hierarchies are introduced. The first one is derived using real algebraic geometry applied to positive polynomials in the entries of a Gram matrix, and is complete in the sense that for every entangled Werner state it converges to a witness. The second one is based on a sum-of-squares certificate for the positivity of trace polynomials in noncommuting variables, and is a relaxation that involves smaller semidefinite constraints.

quant-ph↗

arXiv2022

3D homogenization of the T-A formulation for the analysis of coils with complex geometries

The modeling and analysis of superconducting coils is an essential task in the design stage of most devices based on high-temperature superconductors (HTS). These calculations allow verifying basic estimations and assumptions, proposing improvements, and computing quantities that are not easy to calculate with an analytical approach. For instance, the estimation of losses in HTS is fundamental during the design stage since losses can strongly influence the cooling system requirements and operating temperature. Typically, 2D finite element analysis is used to calculate AC losses in HTS, due to the lack of analytical solutions that can accurately represent complex operating conditions such as AC transport current and AC external applied magnetic field in coils. These 2D models are usually a representation of an infinitely long arrangement. Therefore, they cannot be used to analyze end effects and complex 3D configurations. In this publication, we use the homogenization of the T-A formulation in 3D for the analysis of superconducting coils with complex geometries where a 2D approach can not provide accurate analyses and verification of assumptions. The modeling methodology allows an easier implementation in commercial software (COMSOL Multiphysics) in comparison with the currently available 3D H homogenization, despite the complexity of the geometry. This methodology is first validated with a racetrack coil (benchmark case) by comparing the results with the well-established H formulation. Then, the electromagnetic behavior of coils with more complex geometries is analyzed.

cond-mat.supr-con↗

arXiv2022

Entropic proofs of Singleton bounds for quantum error-correcting codes

We show that a relatively simple reasoning using von Neumann entropy inequalities yields a robust proof of the quantum Singleton bound for quantum error-correcting codes (QECC). For entanglement-assisted quantum error-correcting codes (EAQECC) and catalytic codes (CQECC), a type of generalized quantum Singleton bound [Brun et al., IEEE Trans. Inf. Theory 60(6):3073--3089 (2014)] was believed to hold for many years until recently one of us found a counterexample [MG, Phys. Rev. A 103, 020601 (2021)]. Here, we rectify this state of affairs by proving the correct generalized quantum Singleton bound, extending the above-mentioned proof method for QECC; we also prove information-theoretically tight bounds on the entanglement-communication tradeoff for EAQECC. All of the bounds relate block length $n$ and code length $k$ for given minimum distance $d$ and we show that they are robust, in the sense that they hold with small perturbations for codes which only correct most of the erasure errors of less than $d$ letters. In contrast to the classical case, the bounds take on qualitatively different forms depending on whether the minimum distance is smaller or larger than half the block length. We also provide a propagation rule: any pure QECC yields an EAQECC with the same distance and dimension, but of shorter block length.

quant-ph↗

arXiv2022

Training Characteristic Functions with Reinforcement Learning: XAI-methods play Connect Four

One of the goals of Explainable AI (XAI) is to determine which input components were relevant for a classifier decision. This is commonly know as saliency attribution. Characteristic functions (from cooperative game theory) are able to evaluate partial inputs and form the basis for theoretically "fair" attribution methods like Shapley values. Given only a standard classifier function, it is unclear how partial input should be realised. Instead, most XAI-methods for black-box classifiers like neural networks consider counterfactual inputs that generally lie off-manifold. This makes them hard to evaluate and easy to manipulate. We propose a setup to directly train characteristic functions in the form of neural networks to play simple two-player games. We apply this to the game of Connect Four by randomly hiding colour information from our agents during training. This has three advantages for comparing XAI-methods: It alleviates the ambiguity about how to realise partial input, makes off-manifold evaluation unnecessary and allows us to compare the methods by letting them play against each other.

cs.LG↗

arXiv2021

Conjugate Logic

We propose a conjugate logic that can capture the behavior of quantum and quantum-like systems. The proposal is similar to the more generic concept of epistemic logic: it encodes knowledge or perhaps more correctly, predictions about outcomes of future observations on some systems. For a quantum system, these predictions are statements about future outcomes of measurements performed on specific degrees of freedom of the system. The proposed logic will include propositions and their relations including connectives, but importantly also transformations between propositions on conjugate degrees of freedom of the systems. A key point is the addition of a transformation that allows to convert propositions about single systems into propositions about correlations between systems. We will see that subtle choices of the properties of the transformations lead to drastically different underlying mathematical models; one choice gives stabilizer quantum mechanics, while another choice gives Spekkens' toy theory. This points to a crucial basic property of quantum and quantum-like systems that can be handled within the present conjugate logic by adjusting the mentioned choice. It also enables a discussion on what behaviors are properly quantum or only quantum-like, relating to that choice and how it manifests in the system under scrutiny.

quant-ph↗

arXiv2021

Quantum error-correcting codes and their geometries

This is an expository article aiming to introduce the reader to the underlying mathematics and geometry of quantum error correction. Information stored on quantum particles is subject to noise and interference from the environment. Quantum error-correcting codes allow the negation of these effects in order to successfully restore the original quantum information. We briefly describe the necessary quantum mechanical background to be able to understand how quantum error-correction works. We go on to construct quantum codes: firstly qubit stabilizer codes, then qubit non-stabilizer codes, and finally codes with a higher local dimension. We will delve into the geometry of these codes. This allows one to deduce the parameters of the code efficiently, deduce the inequivalence between codes that have the same parameters, and presents a useful tool in deducing the feasibility of certain parameters. We also include sections on quantum maximum distance separable codes and the quantum MacWilliams identities.

quant-ph↗

arXiv2021

Matrix forms of immanant inequalities

We translate inequalities and conjectures for immanants and generalized matrix functions into inequalities in the Löwner order. These have the form of trace polynomials and generalize the inequalities from [FH, J. Math. Phys. 62 (2021), 2, 022203].

math.RT↗

arXiv2020

Tensor polynomial identities

Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their associated Young tableaux. Furthermore, we provide a method to evaluate arbitrary alternating tensor polynomials in $d^2$ variables.

math.RA↗

arXiv2020

Universal quantum computation and quantum error correction with ultracold atomic mixtures

Quantum information platforms made great progress in the control of many-body entanglement and the implementation of quantum error correction, but it remains a challenge to realize both in the same setup. Here, we propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates, while providing a natural candidate for quantum error-correction. In this proposed setup, one atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information. The second atomic species yields phononic excitations, which are used to entangle collective spins. Finally, we discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins, opening up the possibility to universal fault-tolerant quantum computation in ultracold atom systems.

cond-mat.quant-gas↗

arXiv2020

Positive maps and trace polynomials from the symmetric group

With techniques borrowed from quantum information theory, we develop a method to systematically obtain operator inequalities and identities in several matrix variables. These take the form of trace polynomials: polynomial-like expressions that involve matrix monomials $X_{α_1} \cdots X_{α_r}$ and their traces $\operatorname{tr}(X_{α_1} \cdots X_{α_r})$. Our method rests on translating the action of the symmetric group on tensor product spaces into that of matrix multiplication. As a result, we extend the polarized Cayley-Hamilton identity to an operator inequality on the positive cone, characterize the set of multilinear equivariant positive maps in terms of Werner state witnesses, and construct permutation polynomials and tensor polynomial identities on tensor product spaces. We give connections to concepts in quantum information theory and invariant theory.

quant-ph↗

arXiv2020

Quantum Codes of Maximal Distance and Highly Entangled Subspaces

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d \geq 3$ is bounded by $n \leq D^2 + d - 2$. We obtain their weight distribution and present additional bounds that arise from Rains' shadow inequalities. Our main result can be seen as a generalization of bounds that are known for the two special cases of stabilizer QMDS codes and absolutely maximally entangled states, and confirms the quantum MDS conjecture in the special case of distance-three codes. As the existence of QMDS codes is linked to that of highly entangled subspaces (in which every vector has uniform $r$-body marginals) of maximal dimension, our methods directly carry over to address questions in multipartite entanglement.

quant-ph↗

arXiv2019

Taxonomy-as-a-Service: How To Structure Your Related Work

Structuring related work is a daunting task encompassing literature review, classification, comparison (primarily in the form of concepts), and gap analysis. Building taxonomies is a compelling way to structure concepts in the literature yielding reusable and extensible models. However, constructing taxonomies as a product of literature reviews could become, to our experiences, immensely complex and error-prone. Including new literature or addressing errors may cause substantial changes (ripple effects) in taxonomies coping with which requires adequate tools. To this end, we propose a \emph{Taxonomy-as-a-Service (TaaS)} platform. TaaS combines the systematic paper review process with taxonomy development, visualization, and analysis capabilities. We evaluate the effectiveness and efficiency of our platform by employing it in the development of a real-world taxonomy. Our results indicate that our TaaS can be used to effectively craft and maintain UML-conforming taxonomies and thereby structure related work. The screencast of our tool demonstration is available at \url{https://goo.gl/GsTjsP}.

cs.DL↗

arXiv2019

Constraints on correlations in multiqubit systems

The set of correlations between particles in multipartite quantum systems is larger than those in classical systems. Nevertheless, it is subject to restrictions by the underlying quantum theory. In order to better understand the structure of this set, a possible strategy is to divide all correlations into two components, depending on the question of whether they involve an odd or an even number of particles. For pure multi-qubit states we prove that these two components are inextricably interwoven and often one type of correlations completely determines the other. As an application, we prove that all pure qubit states with an odd number of qubits are uniquely determined among all mixed states by the odd component of the correlations. In addition, our approach leads to invariants under the time evolution with Hamiltonians containing only odd correlations and can simplify entanglement detection.

quant-ph↗