Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information-theoretic approaches to adversarial scenarios, quantum simulation, and quantum gravity

Arcos, Maite

Published Oct 28, 2025• 0 citations
OpenAlex

Abstract

This thesis explores connections between information theory, economics, quantum physics, and gravity. Part I introduces adversarial resource theories, extending traditional re-source theories to settings involving strategic interactions. While standard approaches quantify resources for information-processing tasks, they often neglect adversarial or game-theoretic contexts—common in physics, cryptog-raphy, and economics. By incorporating tools from expected utility theory and zero-sum games, the thesis reinterprets Kelly betting through the lens of resource theories. We extend Kelly’s framework to finite-size regimes, formu-lating it as an optimisation problem with defined resources. This yields an equivalence with expected utility maximisation and allows for generalisation to scenarios with asymmetric information. We further show that generalised Kelly strategies arise as Nash equilibria in distributed adversarial games, and extend the formalism to quantum systems, linking it to entanglement concentration. Part II develops a mathematical framework for analogue quantum sim-ulation of fermionic systems using Jordan algebras. Whereas traditional simulations aim to preserve all observables, many practical tasks only re-quire encoding a subset. Our framework rigorously characterises such encodings for finite-dimensional C*-algebras, including the CAR algebra and its even-parity sector. These results addresses challenges in scalable quantum algorithms for fermionic systems. Part III applies holographic techniques to membrane nucleation, a higher-dimensional analogue of the Schwinger effect. We compute nucleation rates in both Minkowski and de Sitter spacetimes at strong coupling. By evaluating the Euclidean on-shell action for membranes coupled to antisymmetric tensor fields completely analytically, we derive exact critical field strengths and rates, offering insights into vacuum decay and non-perturbative quantum gravity.

Related papers

A resource theory of gambling

Maite Arcos, Renato Renner, Jonathan Oppenheim

Betting games provide a natural setting to capture how information yields strategic advantage. The Kelly criterion for betting, long a cornerstone of portfolio theory and information theory, admits an interpretation in the limit of infinitely many repeated bets. We extend Kelly's seminal result into the single-shot and finite-betting regimes, recasting it as a resource theory of adversarial information. This allows one to quantify what it means for the gambler to have more information than the odds-maker. Given a target rate of return, after a finite number of bets, we compute the optimal strategy which maximises the probability of successfully reaching the target, revealing a risk-reward trade-off characterised by a hierarchy of Rényi divergences between the true distribution and the odds. The optimal strategies in the one-shot regime coincide with strategies maximizing expected utility, and minimising hypothesis testing errors, thereby bridging economic and information-theoretic viewpoints. We then generalize this framework to a distributed side-information game, in which multiple players observe correlated signals about an unknown state. Recasting gambling as an adversarial resource theory provides a unifying lens that connects economic and information-theoretic perspectives, and allows for generalisation to the quantum domain, where quantum side-information and entanglement play analogous roles.

arXiv:2510.08418•Oct 9, 2025•2 citations

An Investigation of Quantum Computational Game Theory

Scott Ricketts, Max Mintz

Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what

•Jan 1, 2006•0 citations

Quantum Information Processing: Theory, Algorithms, and Applications

Mohammad Aamir Sohail

Quantum information processing (QIP) studies the representation, manipulation, and transmission of information using quantum systems. By leveraging counterintuitive quantum phenomena such as superposition and entanglement, QIP enables new paradigms for computation, communication, and learning that can surpass classical limits in certain regimes. Foundational tasks in QIP include quantum data compression, quantum communication, and quantum learning and optimization, which together form the basis for scalable quantum technologies. This thesis develops new frameworks and algorithms at the intersection of quantum information theory, quantum learning, and quantum-inspired modeling. The thesis is organized into three parts. The first part studies quantum compression problems; the second addresses quantum communication; and the third develops quantum learning and optimization frameworks with applications to complex systems. In the first part, a new formulation for lossy quantum-classical source coding, termed rate-channel theory, is introduced, replacing the conventional distortion-based formulation with a posterior-channel-based framework under a block-error criterion. The framework is further generalized to incorporate quantum side information at the decoder. A connection between rate-channel theory and classical rate-distortion theory is also established, showing that optimal rate-distortion performance can be recovered under suitable conditions. These results provide a unified and flexible framework for data compression, which is essential for scalable quantum computing infrastructure, enabling efficient storage of quantum data, such as outputs from quantum sensors (e.g., MRI) and information encoded in photonic systems for satellite and optical communication. In the second part, the problem of computing functions of distributed sources over classical-quantum multiple access channels is studied. A new coding framework is developed that combines algebraic structured codes with unstructured random coding techniques, enabling efficient communication of functions without reconstructing individual sources. The resulting achievable conditions, expressed in terms of single-letter quantum information quantities, strictly enlarge the class of sources for which reliable computation is possible. These results contribute to the theoretical foundations of quantum network communication and are directly relevant to deep-space satellite-based quantum communication, distributed quantum computing, and the design of scalable quantum network infrastructures. In the final part, new approaches to quantum learning and optimization are developed. A geometry-aware quantum optimization framework is proposed based on a novel quantum information metric and an unbiased estimator constructed from single-shot measurements. This leads to an optimization method with constant sample complexity per iteration and provable exponential convergence under mild conditions, while avoiding saddle points and local minima. Such advances are particularly relevant for challenging optimization tasks in quantum sensing and quantum computational modeling of many-body systems. Building on this optimization framework, a Hamiltonian learning approach is introduced to infer interaction structures from time-resolved measurement data, with finite-sample guarantees and polynomial scaling with system size. This framework is further extended to develop a quantum-inspired generative model for gene regulatory network inference, where interactions are encoded as a parameterized Hamiltonian evolving over pseudotime. The proposed methods demonstrate strong performance on synthetic benchmarks and reveal biologically meaningful structures in real-world data, with applications to multi-omics integration, cancer genomics, and systems biology. Overall, this thesis advances the theoretical and algorithmic foundations of quantum information processing, with contributions spanning compression, communication, and learning. These developments support the design of resource-efficient and scalable quantum technologies, enabling applications in quantum sensing, quantum networks, distributed quantum computation, and the modeling of complex physical and biological systems.

•Jan 1, 2026•0 citations

Insights into physical states of loop quantum gravity using techniques from machine learning

Waleed Sherif

Loop quantum gravity offers a rich non-perturbative framework for quantum gravity, yet its dynamics remain extremely difficult to implement in practice. In the canonical formulation, physical states are defined by quantum constraints acting on spin-network states, whose graph, representation, and intertwiner data lead to a highly complex kinematical state space. In the covariant formulation, transition amplitudes are built from spin foam vertex amplitudes whose exact evaluation is computationally demanding. This dissertation develops a computational programme for the dynamics of loop quantum gravity in both its canonical and covariant formulations. The programme combines structure-preserving numerical methods with machine learning techniques, with the aim of preserving the native graph, gauge, and operator structure of the theory while making its dynamical problems accessible to controlled computation at large scale. In the canonical theory, this means using variational Monte Carlo methods and neural quantum states to approximate solutions of quantum constraints. In the covariant theory, it means using neural network surrogates to approximate spin foam vertex amplitudes. In this way, part of the dynamical problem of loop quantum gravity is brought from the purely formal domain into a regime of explicit and controlled numerical study. On the canonical side, a fixed-graph framework is developed in which graph non-enlarging Hamiltonian constraints are recast as variational problems for positive quadratic forms whose minima encode weak constraint equations. This reformulation turns the search for physical states into a ground state problem on truncated Hilbert spaces. To realise this programme in practice, neuraLQX, an open-source high-performance toolkit for variational canonical loop quantum gravity built around graph-aware Hilbert spaces, observables, and constraint operators, was developed as part of this dissertation. It uses Markov chain Monte Carlo methods, and in particular gauge-invariant sampling, stochastic reconfiguration, and quantum states parametrized by neural networks adapted to the locality of the dynamics. To demonstrate the viability of this framework, high-fidelity near-physical states are obtained for Abelian BF theory and for a weak coupling limit of LQG with structure group \(\mathrm{U}(1)^3\) in three and four dimensions. In the four-dimensional model on the complete graph \(K_5\), the analysis shows that the ordering of the vertex Hamiltonian constraint has a strong influence on which solution sectors are found variationally. The relevant operator is the vertex Hamiltonian \(\hat{H}_v\), quantized in the spirit of Thiemann's construction and with the corresponding ordering. Numerically, the weak equations associated with \(\hat{H}_v\) and \(\hat{H}_v^\dagger\) are probed through positive quadratic objectives built from \(\hat{H}_v^\dagger \hat{H}_v\) and \(\hat{H}_v \hat{H}_v^\dagger\). The analysis shows that these two searches do not merely produce different approximations to the same variational state. Instead, they select distinct solution sectors. One sector is peaked on flat connections and appears to describe a non-degenerate spatial quantum geometry. Numerical analysis shows this sector to be consistent with a discrete approximation to a Dittrich-Geiller-type vacuum. The other sector consists of states in the kernel of the volume operator. These states are non-flat and exhibit correlations across the graph, consistent with volume-zero excitations over an Ashtekar-Lewandowski-type vacuum. The relation between the two sectors is asymmetric in the sense that while the Ashtekar-Lewandowski-like states are often solutions for both orderings of the quadratic constraints, the Dittrich-Geiller-like states are not. Thus, one can conclude that the ordering of the Hamiltonian constraint affects which sectors are accessible or selected in the variational search, and it suggests that different orderings may exclude some classes of solutions. On the covariant side, this dissertation develops neural network surrogates for spin foam vertex amplitudes, with the aim of approximating the local building blocks of the path-integral dynamics. Starting with the Euclidean Barrett-Crane amplitude, the numerical problem is shown to separate naturally into two physically distinct tasks. The first is to determine which boundary spin configurations are admissible and therefore lie in the support of the amplitude. The second is to approximate the numerical value assigned to each admissible configuration by the vertex amplitude itself. The support is learned with near-perfect accuracy and generalises across cutoffs, showing that the network can infer and extrapolate the known, algorithmically verifiable \(\mathrm{SU}(2)\) recoupling conditions that determine admissibility in the Barrett-Crane case. By contrast, the amplitude values can be reproduced with high precision at fixed cutoff, but do not extrapolate reliably to larger cutoffs. This shows that the dependence of the vertex amplitude on the boundary quantum geometry is considerably more intricate than the structure of its support. The analysis also demonstrates that the representation of discrete spin data is not a merely technical modelling choice but directly affects how well the relevant quantum-geometric information is exposed to the surrogate model. This observation motivates graph-based surrogate architectures in which the spin foam boundary data and their adjacency structure are built into the model more explicitly. These architectures are then applied to the Lorentzian EPRL amplitude whereby in this case, the thesis first addresses the computational bottleneck of exact evaluation by reducing the runtime of the `sl2cfoam-next` exact evaluator sufficiently to generate large training datasets. Preliminary surrogate results show that the support, as well as the sign, of the EPRL amplitude can also be learned effectively, giving first evidence that graph-based learning can capture part of the admissibility structure of the Lorentzian theory.

•Jan 1, 2026•0 citations

Convex geometry in the characterisation of quantum resources

Bartosz Regula

Various physical phenomena have found use as resources in quantum information processing tasks, and the study of their properties is necessary to provide optimal methods to harness their power. The thesis presents a series of results aiming to characterise the quantitative and operational aspects of general quantum resources, and in particular to establish methods applicable to a variety of resources and emphasise the similarities in their characterisation. Our approach relies on the underlying convex structure of quantum resource theories, employing techniques from convex analysis and optimisation to gain a better understanding of both the fundamental properties of quantum resources as well as our ability to manipulate them efficiently in information processing protocols such as resource distillation. The first part of the thesis introduces a unified framework for resource quantification, establishing general properties of arbitrary convex quantum resource theories and providing insight into the common structure of many physically relevant resources. The second part of the thesis deals with the convex optimisation problems involved in the operational characterisation of two representative quantum resources, quantum entanglement and quantum coherence, where we in particular establish a detailed description of their distillation under several classes of operations, and introduce methods for the interconversion between the two resources. In the final part, we employ geometric methods to characterise the quantification of entanglement measures based on polynomial invariants and apply the results to investigate the monogamy properties of multipartite entanglement.

•Oct 15, 2018•0 citations

Title: Algorithmic Complexity of Quantum Gravity

Jincheng Zhang

Quantum gravity, a theoretical framework attempting to reconcile general relativity and quantum mechanics, presents a profound challenge to our understanding of spacetime. Accurately simulating quantum gravity calculations, particularly those involving complex spacetime geometries and quantum entanglement, demands significant computational resources. Traditional approaches often rely on approximations and heuristics, failing to fully capture the inherent complexity. This paper investigates a novel algorithmic complexity framework for quantum gravity, leveraging information theory and graph theory to quantify the computational challenges. We introduce a 'Quantum Information Landscape' – a layered representation of potential quantum states and their interactions – to provide a more precise assessment of these challenges. The proposed algorithm focuses on identifying and characterizing regions of high computational cost, ultimately informing the design of more efficient simulation techniques. This research seeks to move beyond simple complexity measures and provide a quantifiable metric, informing both theoretical advancements and practical algorithm design within the field of quantum gravity.

•Sep 5, 2026•0 citations
This thesis explores connections between information theory, economics, quantum physics, and gravity. Part I introduces adversarial resource theories, extending traditional re-source theories to settings involving strategic interactions. While standard approaches quantify resources for information-processing tasks, they often neglect adversarial or game-theoretic contexts—common in physics, cryptog-raphy, and economics. By incorporating tools from expected utility theory and zero-sum games, the thesis reinterprets Kelly betting through the lens of resource theories. We extend Kelly’s framework to finite-size regimes, formu-lating it as an optimisation problem with defined resources. This yields an equivalence with expected utility maximisation and allows for generalisation to scenarios with asymmetric information. We further show that generalised Kelly strategies arise as Nash equilibria in distributed adversarial games, and extend the formalism to quantum systems, linking it to entanglement concentration. Part II develops a mathematical framework for analogue quantum sim-ulation of fermionic systems using Jordan algebras. Whereas traditional simulations aim to preserve all observables, many practical tasks only re-quire encoding a subset. Our framework rigorously characterises such encodings for finite-dimensional C*-algebras, including the CAR algebra and its even-parity sector. These results addresses challenges in scalable quantum algorithms for fermionic systems. Part III applies holographic techniques to membrane nucleation, a higher-dimensional analogue of the Schwinger effect. We compute nucleation rates in both Minkowski and de Sitter spacetimes at strong coupling. By evaluating the Euclidean on-shell action for membranes coupled to antisymmetric tensor fields completely analytically, we derive exact critical field strengths and rates, offering insights into vacuum decay and non-perturbative quantum gravity.
Betting games provide a natural setting to capture how information yields strategic advantage. The Kelly criterion for betting, long a cornerstone of portfolio theory and information theory, admits an interpretation in the limit of infinitely many repeated bets. We extend Kelly's seminal result into the single-shot and finite-betting regimes, recasting it as a resource theory of adversarial information. This allows one to quantify what it means for the gambler to have more information than the odds-maker. Given a target rate of return, after a finite number of bets, we compute the optimal strategy which maximises the probability of successfully reaching the target, revealing a risk-reward trade-off characterised by a hierarchy of Rényi divergences between the true distribution and the odds. The optimal strategies in the one-shot regime coincide with strategies maximizing expected utility, and minimising hypothesis testing errors, thereby bridging economic and information-theoretic viewpoints. We then generalize this framework to a distributed side-information game, in which multiple players observe correlated signals about an unknown state. Recasting gambling as an adversarial resource theory provides a unifying lens that connects economic and information-theoretic perspectives, and allows for generalisation to the quantum domain, where quantum side-information and entanglement play analogous roles.
Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what
Quantum information processing (QIP) studies the representation, manipulation, and transmission of information using quantum systems. By leveraging counterintuitive quantum phenomena such as superposition and entanglement, QIP enables new paradigms for computation, communication, and learning that can surpass classical limits in certain regimes. Foundational tasks in QIP include quantum data compression, quantum communication, and quantum learning and optimization, which together form the basis for scalable quantum technologies. This thesis develops new frameworks and algorithms at the intersection of quantum information theory, quantum learning, and quantum-inspired modeling. The thesis is organized into three parts. The first part studies quantum compression problems; the second addresses quantum communication; and the third develops quantum learning and optimization frameworks with applications to complex systems. In the first part, a new formulation for lossy quantum-classical source coding, termed rate-channel theory, is introduced, replacing the conventional distortion-based formulation with a posterior-channel-based framework under a block-error criterion. The framework is further generalized to incorporate quantum side information at the decoder. A connection between rate-channel theory and classical rate-distortion theory is also established, showing that optimal rate-distortion performance can be recovered under suitable conditions. These results provide a unified and flexible framework for data compression, which is essential for scalable quantum computing infrastructure, enabling efficient storage of quantum data, such as outputs from quantum sensors (e.g., MRI) and information encoded in photonic systems for satellite and optical communication. In the second part, the problem of computing functions of distributed sources over classical-quantum multiple access channels is studied. A new coding framework is developed that combines algebraic structured codes with unstructured random coding techniques, enabling efficient communication of functions without reconstructing individual sources. The resulting achievable conditions, expressed in terms of single-letter quantum information quantities, strictly enlarge the class of sources for which reliable computation is possible. These results contribute to the theoretical foundations of quantum network communication and are directly relevant to deep-space satellite-based quantum communication, distributed quantum computing, and the design of scalable quantum network infrastructures. In the final part, new approaches to quantum learning and optimization are developed. A geometry-aware quantum optimization framework is proposed based on a novel quantum information metric and an unbiased estimator constructed from single-shot measurements. This leads to an optimization method with constant sample complexity per iteration and provable exponential convergence under mild conditions, while avoiding saddle points and local minima. Such advances are particularly relevant for challenging optimization tasks in quantum sensing and quantum computational modeling of many-body systems. Building on this optimization framework, a Hamiltonian learning approach is introduced to infer interaction structures from time-resolved measurement data, with finite-sample guarantees and polynomial scaling with system size. This framework is further extended to develop a quantum-inspired generative model for gene regulatory network inference, where interactions are encoded as a parameterized Hamiltonian evolving over pseudotime. The proposed methods demonstrate strong performance on synthetic benchmarks and reveal biologically meaningful structures in real-world data, with applications to multi-omics integration, cancer genomics, and systems biology. Overall, this thesis advances the theoretical and algorithmic foundations of quantum information processing, with contributions spanning compression, communication, and learning. These developments support the design of resource-efficient and scalable quantum technologies, enabling applications in quantum sensing, quantum networks, distributed quantum computation, and the modeling of complex physical and biological systems.
Loop quantum gravity offers a rich non-perturbative framework for quantum gravity, yet its dynamics remain extremely difficult to implement in practice. In the canonical formulation, physical states are defined by quantum constraints acting on spin-network states, whose graph, representation, and intertwiner data lead to a highly complex kinematical state space. In the covariant formulation, transition amplitudes are built from spin foam vertex amplitudes whose exact evaluation is computationally demanding. This dissertation develops a computational programme for the dynamics of loop quantum gravity in both its canonical and covariant formulations. The programme combines structure-preserving numerical methods with machine learning techniques, with the aim of preserving the native graph, gauge, and operator structure of the theory while making its dynamical problems accessible to controlled computation at large scale. In the canonical theory, this means using variational Monte Carlo methods and neural quantum states to approximate solutions of quantum constraints. In the covariant theory, it means using neural network surrogates to approximate spin foam vertex amplitudes. In this way, part of the dynamical problem of loop quantum gravity is brought from the purely formal domain into a regime of explicit and controlled numerical study. On the canonical side, a fixed-graph framework is developed in which graph non-enlarging Hamiltonian constraints are recast as variational problems for positive quadratic forms whose minima encode weak constraint equations. This reformulation turns the search for physical states into a ground state problem on truncated Hilbert spaces. To realise this programme in practice, neuraLQX, an open-source high-performance toolkit for variational canonical loop quantum gravity built around graph-aware Hilbert spaces, observables, and constraint operators, was developed as part of this dissertation. It uses Markov chain Monte Carlo methods, and in particular gauge-invariant sampling, stochastic reconfiguration, and quantum states parametrized by neural networks adapted to the locality of the dynamics. To demonstrate the viability of this framework, high-fidelity near-physical states are obtained for Abelian BF theory and for a weak coupling limit of LQG with structure group U(1)3\mathrm{U}(1)^3U(1)3 in three and four dimensions. In the four-dimensional model on the complete graph K5K_5K5​, the analysis shows that the ordering of the vertex Hamiltonian constraint has a strong influence on which solution sectors are found variationally. The relevant operator is the vertex Hamiltonian H^v\hat{H}_vH^v​, quantized in the spirit of Thiemann's construction and with the corresponding ordering. Numerically, the weak equations associated with H^v\hat{H}_vH^v​ and H^v†\hat{H}_v^\daggerH^v†​ are probed through positive quadratic objectives built from H^v†H^v\hat{H}_v^\dagger \hat{H}_vH^v†​H^v​ and H^vH^v†\hat{H}_v \hat{H}_v^\daggerH^v​H^v†​. The analysis shows that these two searches do not merely produce different approximations to the same variational state. Instead, they select distinct solution sectors. One sector is peaked on flat connections and appears to describe a non-degenerate spatial quantum geometry. Numerical analysis shows this sector to be consistent with a discrete approximation to a Dittrich-Geiller-type vacuum. The other sector consists of states in the kernel of the volume operator. These states are non-flat and exhibit correlations across the graph, consistent with volume-zero excitations over an Ashtekar-Lewandowski-type vacuum. The relation between the two sectors is asymmetric in the sense that while the Ashtekar-Lewandowski-like states are often solutions for both orderings of the quadratic constraints, the Dittrich-Geiller-like states are not. Thus, one can conclude that the ordering of the Hamiltonian constraint affects which sectors are accessible or selected in the variational search, and it suggests that different orderings may exclude some classes of solutions. On the covariant side, this dissertation develops neural network surrogates for spin foam vertex amplitudes, with the aim of approximating the local building blocks of the path-integral dynamics. Starting with the Euclidean Barrett-Crane amplitude, the numerical problem is shown to separate naturally into two physically distinct tasks. The first is to determine which boundary spin configurations are admissible and therefore lie in the support of the amplitude. The second is to approximate the numerical value assigned to each admissible configuration by the vertex amplitude itself. The support is learned with near-perfect accuracy and generalises across cutoffs, showing that the network can infer and extrapolate the known, algorithmically verifiable SU(2)\mathrm{SU}(2)SU(2) recoupling conditions that determine admissibility in the Barrett-Crane case. By contrast, the amplitude values can be reproduced with high precision at fixed cutoff, but do not extrapolate reliably to larger cutoffs. This shows that the dependence of the vertex amplitude on the boundary quantum geometry is considerably more intricate than the structure of its support. The analysis also demonstrates that the representation of discrete spin data is not a merely technical modelling choice but directly affects how well the relevant quantum-geometric information is exposed to the surrogate model. This observation motivates graph-based surrogate architectures in which the spin foam boundary data and their adjacency structure are built into the model more explicitly. These architectures are then applied to the Lorentzian EPRL amplitude whereby in this case, the thesis first addresses the computational bottleneck of exact evaluation by reducing the runtime of the `sl2cfoam-next` exact evaluator sufficiently to generate large training datasets. Preliminary surrogate results show that the support, as well as the sign, of the EPRL amplitude can also be learned effectively, giving first evidence that graph-based learning can capture part of the admissibility structure of the Lorentzian theory.
Various physical phenomena have found use as resources in quantum information processing tasks, and the study of their properties is necessary to provide optimal methods to harness their power. The thesis presents a series of results aiming to characterise the quantitative and operational aspects of general quantum resources, and in particular to establish methods applicable to a variety of resources and emphasise the similarities in their characterisation. Our approach relies on the underlying convex structure of quantum resource theories, employing techniques from convex analysis and optimisation to gain a better understanding of both the fundamental properties of quantum resources as well as our ability to manipulate them efficiently in information processing protocols such as resource distillation. The first part of the thesis introduces a unified framework for resource quantification, establishing general properties of arbitrary convex quantum resource theories and providing insight into the common structure of many physically relevant resources. The second part of the thesis deals with the convex optimisation problems involved in the operational characterisation of two representative quantum resources, quantum entanglement and quantum coherence, where we in particular establish a detailed description of their distillation under several classes of operations, and introduce methods for the interconversion between the two resources. In the final part, we employ geometric methods to characterise the quantification of entanglement measures based on polynomial invariants and apply the results to investigate the monogamy properties of multipartite entanglement.
Quantum gravity, a theoretical framework attempting to reconcile general relativity and quantum mechanics, presents a profound challenge to our understanding of spacetime. Accurately simulating quantum gravity calculations, particularly those involving complex spacetime geometries and quantum entanglement, demands significant computational resources. Traditional approaches often rely on approximations and heuristics, failing to fully capture the inherent complexity. This paper investigates a novel algorithmic complexity framework for quantum gravity, leveraging information theory and graph theory to quantify the computational challenges. We introduce a 'Quantum Information Landscape' – a layered representation of potential quantum states and their interactions – to provide a more precise assessment of these challenges. The proposed algorithm focuses on identifying and characterizing regions of high computational cost, ultimately informing the design of more efficient simulation techniques. This research seeks to move beyond simple complexity measures and provide a quantifiable metric, informing both theoretical advancements and practical algorithm design within the field of quantum gravity.