Pub Date : 2026-01-19DOI: 10.22331/q-2026-01-19-1973
Jonathan Conrad, Jens Eisert, Steven T. Flammia
We consider the task of performing shadow tomography of a logical subsystem defined via the Gottesman-Kitaev-Preskill (GKP) error correcting code. Our protocol does not require the input state to be a code state but is implemented by appropriate twirling of the measurement channel, such that the encoded logical tomographic information becomes encoded in the classical shadow. We showcase this protocol for measurements natural in continuous variable (CV) quantum computing. For heterodyne measurement, the protocol yields a probabilistic decomposition of any input state into Gaussian states that simulate the encoded logical information of the input relative to a fixed GKP code where we prove bounds on the Gaussian compressibility of states in this setting. For photon parity measurements, our protocol is equivalent to a Wigner sampling protocol for which we develop the appropriate sampling strategies. Finally, by randomizing over the reference GKP code, we show how Wigner samples of any input state relative to a random GKP codes can be used to estimate any sufficiently bounded observable.
{"title":"Chasing shadows with Gottesman-Kitaev-Preskill codes","authors":"Jonathan Conrad, Jens Eisert, Steven T. Flammia","doi":"10.22331/q-2026-01-19-1973","DOIUrl":"https://doi.org/10.22331/q-2026-01-19-1973","url":null,"abstract":"We consider the task of performing shadow tomography of a logical subsystem defined via the Gottesman-Kitaev-Preskill (GKP) error correcting code. Our protocol does not require the input state to be a code state but is implemented by appropriate twirling of the measurement channel, such that the encoded logical tomographic information becomes encoded in the classical shadow. We showcase this protocol for measurements natural in continuous variable (CV) quantum computing. For heterodyne measurement, the protocol yields a probabilistic decomposition of any input state into Gaussian states that simulate the encoded logical information of the input relative to a fixed GKP code where we prove bounds on the Gaussian compressibility of states in this setting. For photon parity measurements, our protocol is equivalent to a Wigner sampling protocol for which we develop the appropriate sampling strategies. Finally, by randomizing over the reference GKP code, we show how Wigner samples of any input state relative to a random GKP codes can be used to estimate any sufficiently bounded observable.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"196 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-19DOI: 10.22331/q-2026-01-19-1972
Giovanni de Felice, Boldizsár Poór, Cole Comfort, Lia Yeh, Mateusz Kupper, William Cashman, Bob Coecke
Photonic systems offer a promising platform for interconnecting quantum processors and enabling scalable, networked architectures. Designing and verifying such architectures requires a unified formalism that integrates linear algebraic reasoning with probabilistic and control-flow structures. In this work, we introduce a graphical framework for distributed quantum computing that brings together linear optics, the ZX-calculus, and dataflow programming. Our language supports the formal analysis and optimization of distributed protocols involving both qubits and photonic modes, with explicit interfaces for classical control and feedforward, all expressed within a synchronous dataflow model with discrete-time dynamics. Within this setting, we classify entangling photonic fusion measurements, show how their induced Pauli errors can be corrected via a novel flow structure for fusion networks, and establish correctness proofs for new repeat-until-success protocols enabling arbitrary fusions. Layer by layer, we construct qubit architectures incorporating practical optical components such as beam splitters, switches, and photon sources, with graphical proofs that they are deterministic and support universal quantum computation. Together, these results establish a foundation for verifiable compilation and automated optimization in networked quantum computing.
{"title":"A dataflow programming framework for linear optical distributed quantum computing","authors":"Giovanni de Felice, Boldizsár Poór, Cole Comfort, Lia Yeh, Mateusz Kupper, William Cashman, Bob Coecke","doi":"10.22331/q-2026-01-19-1972","DOIUrl":"https://doi.org/10.22331/q-2026-01-19-1972","url":null,"abstract":"Photonic systems offer a promising platform for interconnecting quantum processors and enabling scalable, networked architectures. Designing and verifying such architectures requires a unified formalism that integrates linear algebraic reasoning with probabilistic and control-flow structures. In this work, we introduce a graphical framework for distributed quantum computing that brings together linear optics, the ZX-calculus, and dataflow programming. Our language supports the formal analysis and optimization of distributed protocols involving both qubits and photonic modes, with explicit interfaces for classical control and feedforward, all expressed within a synchronous dataflow model with discrete-time dynamics. Within this setting, we classify entangling photonic fusion measurements, show how their induced Pauli errors can be corrected via a novel flow structure for fusion networks, and establish correctness proofs for new repeat-until-success protocols enabling arbitrary fusions. Layer by layer, we construct qubit architectures incorporating practical optical components such as beam splitters, switches, and photon sources, with graphical proofs that they are deterministic and support universal quantum computation. Together, these results establish a foundation for verifiable compilation and automated optimization in networked quantum computing.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"276 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-19DOI: 10.22331/q-2026-01-19-1969
Dong An, Konstantina Trivisa
High-dimensional fractional reaction-diffusion equations have numerous applications in the fields of biology, chemistry, and physics, and exhibit a range of rich phenomena. While classical algorithms have an exponential complexity in the spatial dimension, a quantum computer can produce a quantum state that encodes the solution with only polynomial complexity, provided that suitable input access is available. In this work, we investigate efficient quantum algorithms for linear and nonlinear fractional reaction-diffusion equations with periodic boundary conditions. For linear equations, we analyze and compare the complexity of various methods, including the second-order Trotter formula, time-marching method, and truncated Dyson series method. We also present a novel algorithm that combines the linear combination of Hamiltonian simulation technique with the interaction picture formalism, resulting in optimal scaling in the spatial dimension. For nonlinear equations, we employ the Carleman linearization method and propose a block-encoding version that is appropriate for the dense matrices that arise from the spatial discretization of fractional reaction-diffusion equations.
{"title":"Quantum algorithms for linear and non-linear fractional reaction-diffusion equations","authors":"Dong An, Konstantina Trivisa","doi":"10.22331/q-2026-01-19-1969","DOIUrl":"https://doi.org/10.22331/q-2026-01-19-1969","url":null,"abstract":"High-dimensional fractional reaction-diffusion equations have numerous applications in the fields of biology, chemistry, and physics, and exhibit a range of rich phenomena. While classical algorithms have an exponential complexity in the spatial dimension, a quantum computer can produce a quantum state that encodes the solution with only polynomial complexity, provided that suitable input access is available. In this work, we investigate efficient quantum algorithms for linear and nonlinear fractional reaction-diffusion equations with periodic boundary conditions. For linear equations, we analyze and compare the complexity of various methods, including the second-order Trotter formula, time-marching method, and truncated Dyson series method. We also present a novel algorithm that combines the linear combination of Hamiltonian simulation technique with the interaction picture formalism, resulting in optimal scaling in the spatial dimension. For nonlinear equations, we employ the Carleman linearization method and propose a block-encoding version that is appropriate for the dense matrices that arise from the spatial discretization of fractional reaction-diffusion equations.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"225 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145995427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The occurrence of a second-order quantum phase transition in the Dicke model is a well-established feature. On the contrary, a comprehensive understanding of the corresponding open system, particularly in the proximity of the critical point, remains elusive. When approaching the critical point, the system inevitably enters first the system-bath ultrastrong coupling regime and finally the deepstrong coupling regime, causing the failure of usual approximations adopted to describe open quantum systems. We study the interaction of the Dicke model with bosonic bath fields in the absence of additional approximations, which usually relies on the weakness of the system-bath coupling. We find that the critical point is not affected by the interaction with the environment. Moreover, the interaction with the environment is not able to affect the system ground-state condensates in the superradiant phase, whereas the bath fields are $infected$ by the system and acquire macroscopic occupations. The obtained reflection spectra display lineshapes which become increasingly asymmetric, both in the normal and superradiant phases, when approaching the critical point.
{"title":"Superradiant Quantum Phase Transition in Open Systems: System-Bath Interaction at the Critical Point","authors":"Daniele Lamberto, Gabriele Orlando, Salvatore Savasta","doi":"10.22331/q-2026-01-19-1970","DOIUrl":"https://doi.org/10.22331/q-2026-01-19-1970","url":null,"abstract":"The occurrence of a second-order quantum phase transition in the Dicke model is a well-established feature. On the contrary, a comprehensive understanding of the corresponding open system, particularly in the proximity of the critical point, remains elusive. When approaching the critical point, the system inevitably enters first the system-bath ultrastrong coupling regime and finally the deepstrong coupling regime, causing the failure of usual approximations adopted to describe open quantum systems. We study the interaction of the Dicke model with bosonic bath fields in the absence of additional approximations, which usually relies on the weakness of the system-bath coupling. We find that the critical point is not affected by the interaction with the environment. Moreover, the interaction with the environment is not able to affect the system ground-state condensates in the superradiant phase, whereas the bath fields are $infected$ by the system and acquire macroscopic occupations. The obtained reflection spectra display lineshapes which become increasingly asymmetric, both in the normal and superradiant phases, when approaching the critical point.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"383 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145995428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-19DOI: 10.22331/q-2026-01-19-1971
Arsalan Motamedi, Yuan Yao, Kasper Nielsen, Ulysse Chabaud, J. Eli Bourassa, Rafael N. Alexander, Filippo M. Miatto
We introduce the $textit{stellar decomposition}$, a novel method for characterizing non-Gaussian states produced by photon-counting measurements on Gaussian states. Given an $(m+n)$-mode Gaussian state $G$, we express it as an $(m+n)$-mode "Gaussian core state" $G_{mathrm{core}}$ followed by an $m$-mode Gaussian transformation $T$ that only acts on the first $m$ modes. The defining property of the Gaussian core state $G_{mathrm{core}}$ is that measuring the last $n$ of its modes in the photon-number basis leaves the first $m$ modes on a finite Fock support, i.e. a core state. Since $T$ is measurement-independent and $G_{mathrm{core}}$ has an exact and finite Fock representation, this decomposition exactly describes all non-Gaussian states obtainable by projecting $n$ modes of $G$ onto the Fock basis. For pure states we prove that a physical pair $(G_{mathrm{core}}, T)$ always exists with $G_{mathrm{core}}$ pure and $T$ unitary. For mixed states, we establish necessary and sufficient conditions for $(G_{mathrm{core}}, T)$ to be a Gaussian mixed state and a Gaussian channel. We also develop a semidefinite program to extract the "largest" possible Gaussian channel when these conditions fail. Finally, we present a formal stellar decomposition for generic operators, which is useful in simulations where the only requirement is that the two parts contract back to the original operator. The stellar decomposition leads to practical bounds on achievable state quality in photonic circuits and for GKP state generation in particular. Our results are based on a new characterization of Gaussian completely positive maps in the Bargmann picture, which may be of independent interest.
{"title":"The stellar decomposition of Gaussian quantum states","authors":"Arsalan Motamedi, Yuan Yao, Kasper Nielsen, Ulysse Chabaud, J. Eli Bourassa, Rafael N. Alexander, Filippo M. Miatto","doi":"10.22331/q-2026-01-19-1971","DOIUrl":"https://doi.org/10.22331/q-2026-01-19-1971","url":null,"abstract":"We introduce the $textit{stellar decomposition}$, a novel method for characterizing non-Gaussian states produced by photon-counting measurements on Gaussian states. Given an $(m+n)$-mode Gaussian state $G$, we express it as an $(m+n)$-mode \"Gaussian core state\" $G_{mathrm{core}}$ followed by an $m$-mode Gaussian transformation $T$ that only acts on the first $m$ modes. The defining property of the Gaussian core state $G_{mathrm{core}}$ is that measuring the last $n$ of its modes in the photon-number basis leaves the first $m$ modes on a finite Fock support, i.e. a core state. Since $T$ is measurement-independent and $G_{mathrm{core}}$ has an exact and finite Fock representation, this decomposition exactly describes all non-Gaussian states obtainable by projecting $n$ modes of $G$ onto the Fock basis. For pure states we prove that a physical pair $(G_{mathrm{core}}, T)$ always exists with $G_{mathrm{core}}$ pure and $T$ unitary. For mixed states, we establish necessary and sufficient conditions for $(G_{mathrm{core}}, T)$ to be a Gaussian mixed state and a Gaussian channel. We also develop a semidefinite program to extract the \"largest\" possible Gaussian channel when these conditions fail. Finally, we present a formal stellar decomposition for generic operators, which is useful in simulations where the only requirement is that the two parts contract back to the original operator. The stellar decomposition leads to practical bounds on achievable state quality in photonic circuits and for GKP state generation in particular. Our results are based on a new characterization of Gaussian completely positive maps in the Bargmann picture, which may be of independent interest.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"58 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-19DOI: 10.22331/q-2026-01-19-1974
Kaoru Mizuta
A multi-product formula (MPF) is a promising approach for Hamiltonian simulation efficiently both in the system size $N$ and the inverse allowable error $1/varepsilon$ by combining Trotterization and the linear combination of unitaries (LCU). It achieves poly-logarithmic cost in $1/varepsilon$ like LCU [G. H. Low, V. Kliuchnikov, N. Wiebe, (2019)]. The efficiency in $N$ is expected to come from the commutator scaling in Trotterization, and this appears to be confirmed by the error bound of MPF expressed by nested commutators [J. Aftab, D. An, K. Trivisa, (2024)]. However, we point out that the efficiency of MPF in the system size $N$ is not exactly resolved yet in that the present error bound expressed by nested commutators is incompatible with the size-efficient complexity reflecting the commutator scaling. The problem is that $q$-fold nested commutators with arbitrarily large $q$ are involved in their requirement and error bound. The benefit of commutator scaling by locality is absent, and the cost efficient in $N$ becomes prohibited in general. In this paper, we show an alternative commutator-scaling error of MPF and derive its size-efficient cost properly inheriting the advantage in Trotterization. The requirement and the error bound in our analysis, derived by techniques from the Floquet-Magnus expansion, have a certain truncation order in the nested commutators and can fully exploit the locality. We prove that Hamiltonian simulation by MPF certainly achieves the cost whose system-size dependence is as large as Trotterization while keeping the $mathrm{polylog}(1/varepsilon)$-scaling like the LCU. Our results will provide improved or accurate error and cost also for various algorithms using interpolation or extrapolation of Trotterization.
{"title":"On the commutator scaling in Hamiltonian simulation with multi-product formulas","authors":"Kaoru Mizuta","doi":"10.22331/q-2026-01-19-1974","DOIUrl":"https://doi.org/10.22331/q-2026-01-19-1974","url":null,"abstract":"A multi-product formula (MPF) is a promising approach for Hamiltonian simulation efficiently both in the system size $N$ and the inverse allowable error $1/varepsilon$ by combining Trotterization and the linear combination of unitaries (LCU). It achieves poly-logarithmic cost in $1/varepsilon$ like LCU [G. H. Low, V. Kliuchnikov, N. Wiebe, (2019)]. The efficiency in $N$ is expected to come from the commutator scaling in Trotterization, and this appears to be confirmed by the error bound of MPF expressed by nested commutators [J. Aftab, D. An, K. Trivisa, (2024)]. However, we point out that the efficiency of MPF in the system size $N$ is not exactly resolved yet in that the present error bound expressed by nested commutators is incompatible with the size-efficient complexity reflecting the commutator scaling. The problem is that $q$-fold nested commutators with arbitrarily large $q$ are involved in their requirement and error bound. The benefit of commutator scaling by locality is absent, and the cost efficient in $N$ becomes prohibited in general. In this paper, we show an alternative commutator-scaling error of MPF and derive its size-efficient cost properly inheriting the advantage in Trotterization. The requirement and the error bound in our analysis, derived by techniques from the Floquet-Magnus expansion, have a certain truncation order in the nested commutators and can fully exploit the locality. We prove that Hamiltonian simulation by MPF certainly achieves the cost whose system-size dependence is as large as Trotterization while keeping the $mathrm{polylog}(1/varepsilon)$-scaling like the LCU. Our results will provide improved or accurate error and cost also for various algorithms using interpolation or extrapolation of Trotterization.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"88 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-16DOI: 10.22331/q-2026-01-16-1967
Tzu-Hsuan Huang, Yeong-Luh Ueng
Recent research has shown that syndrome-based belief propagation using layered scheduling (sLBP) can not only accelerate the convergence rate but also improve the error rate performance by breaking the quantum trapping sets for quantum low-density parity-check (QLDPC) codes, showcasing a result distinct from classical error correction codes. In this paper, we consider edge-wise informed dynamic scheduling (IDS) for QLDPC codes based on syndrome-based residual belief propagation (sRBP). However, the construction of QLDPC codes and the identical prior intrinsic information assignment will result in an equal residual in many edges, causing a performance limitation for sRBP. Two heuristic strategies, including edge pool design and error pre-correction, are introduced to tackle this obstacle and quantum trapping sets. Then, a novel sRBP equipped with a predict-and-reduce-error mechanism (PRE-sRBP) is proposed, which can provide over one order of performance gain on the considered bicycle codes and symmetric hypergraph (HP) code under similar iterations compared to sLBP.
{"title":"Informed Dynamic Scheduling for QLDPC Codes","authors":"Tzu-Hsuan Huang, Yeong-Luh Ueng","doi":"10.22331/q-2026-01-16-1967","DOIUrl":"https://doi.org/10.22331/q-2026-01-16-1967","url":null,"abstract":"Recent research has shown that syndrome-based belief propagation using layered scheduling (sLBP) can not only accelerate the convergence rate but also improve the error rate performance by breaking the quantum trapping sets for quantum low-density parity-check (QLDPC) codes, showcasing a result distinct from classical error correction codes. In this paper, we consider edge-wise informed dynamic scheduling (IDS) for QLDPC codes based on syndrome-based residual belief propagation (sRBP). However, the construction of QLDPC codes and the identical prior intrinsic information assignment will result in an equal residual in many edges, causing a performance limitation for sRBP. Two heuristic strategies, including edge pool design and error pre-correction, are introduced to tackle this obstacle and quantum trapping sets. Then, a novel sRBP equipped with a predict-and-reduce-error mechanism (PRE-sRBP) is proposed, which can provide over one order of performance gain on the considered bicycle codes and symmetric hypergraph (HP) code under similar iterations compared to sLBP.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"57 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145972329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-16DOI: 10.22331/q-2026-01-16-1968
L. Spagnoli, A. Roggero, N. Wiebe
We show in this paper that a strong and easy connection exists between quantum error correction and Lattice Gauge Theories (LGT) by using the Gauge symmetry to construct an efficient error-correcting code for Abelian $mathbb{Z_2}$ LGTs. We identify the logical operations on this gauge covariant code and show that the corresponding Hamiltonian can be expressed in terms of these logical operations while preserving the locality of the interactions. Furthermore, we demonstrate that these substitutions actually give a new way of writing the LGT as an equivalent hardcore boson model. Finally we demonstrate a method to perform fault-tolerant time evolution of the Hamiltonian within the gauge covariant code using both product formulas and qubitization approaches. This opens up the possibility of inexpensive end to end dynamical simulations that save physical qubits by blurring the lines between simulation algorithms and quantum error correcting codes.
{"title":"Fault-tolerant simulation of Lattice Gauge Theories with gauge covariant codes","authors":"L. Spagnoli, A. Roggero, N. Wiebe","doi":"10.22331/q-2026-01-16-1968","DOIUrl":"https://doi.org/10.22331/q-2026-01-16-1968","url":null,"abstract":"We show in this paper that a strong and easy connection exists between quantum error correction and Lattice Gauge Theories (LGT) by using the Gauge symmetry to construct an efficient error-correcting code for Abelian $mathbb{Z_2}$ LGTs. We identify the logical operations on this gauge covariant code and show that the corresponding Hamiltonian can be expressed in terms of these logical operations while preserving the locality of the interactions. Furthermore, we demonstrate that these substitutions actually give a new way of writing the LGT as an equivalent hardcore boson model. Finally we demonstrate a method to perform fault-tolerant time evolution of the Hamiltonian within the gauge covariant code using both product formulas and qubitization approaches. This opens up the possibility of inexpensive end to end dynamical simulations that save physical qubits by blurring the lines between simulation algorithms and quantum error correcting codes.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"124 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145972370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-16DOI: 10.22331/q-2026-01-16-1966
Caroline L. Jones, Stefan L. Ludescher, Albert Aloy, Markus P. Müller
We demonstrate a fundamental relation between the structures of physical space and of quantum theory: the set of quantum correlations in a rotational prepare-and-measure scenario can be derived from covariance alone, without assuming quantum physics. To show this, we consider a semi-device-independent randomness generation scheme where one of two spatial rotations is performed on an otherwise uncharacterized preparation device, and one of two possible measurement outcomes is subsequently obtained. An upper bound on a theory-independent notion of spin is assumed for the transmitted physical system. It turns out that this determines the set of quantum correlations and the amount of certifiable randomness in this setup exactly. Interestingly, this yields the basis of a theory-independent protocol for the secure generation of random numbers. Our results support the conjecture that the symmetries of space and time determine at least part of the probabilistic structure of quantum theory.
{"title":"Theory-independent randomness generation from spatial symmetries","authors":"Caroline L. Jones, Stefan L. Ludescher, Albert Aloy, Markus P. Müller","doi":"10.22331/q-2026-01-16-1966","DOIUrl":"https://doi.org/10.22331/q-2026-01-16-1966","url":null,"abstract":"We demonstrate a fundamental relation between the structures of physical space and of quantum theory: the set of quantum correlations in a rotational prepare-and-measure scenario can be derived from covariance alone, without assuming quantum physics. To show this, we consider a semi-device-independent randomness generation scheme where one of two spatial rotations is performed on an otherwise uncharacterized preparation device, and one of two possible measurement outcomes is subsequently obtained. An upper bound on a theory-independent notion of spin is assumed for the transmitted physical system. It turns out that this determines the set of quantum correlations and the amount of certifiable randomness in this setup exactly. Interestingly, this yields the basis of a theory-independent protocol for the secure generation of random numbers. Our results support the conjecture that the symmetries of space and time determine at least part of the probabilistic structure of quantum theory.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"19 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145972326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-14DOI: 10.22331/q-2026-01-14-1964
Adina Goldberg
In the flavour of categorical quantum mechanics, we extend nonlocal games to allow quantum questions and answers, using quantum sets (special symmetric dagger Frobenius algebras) and the quantum functions of Musto, Reutter, and Verdon. Equations are presented using a diagrammatic calculus for tensor categories. To this quantum question and answer setting, we extend the standard definitions, including strategies, correlations, and synchronicity, and we use these definitions to extend results about synchronicity. We extend the graph homomorphism (isomorphism) game to quantum graphs, and show it is synchronous (bisynchronous) and connect its perfect (bi)strategies to quantum graph homomorphisms (isomorphisms). Our extended definitions agree with the existing quantum games literature, except in the case of synchronicity.
{"title":"Quantum games and synchronicity","authors":"Adina Goldberg","doi":"10.22331/q-2026-01-14-1964","DOIUrl":"https://doi.org/10.22331/q-2026-01-14-1964","url":null,"abstract":"In the flavour of categorical quantum mechanics, we extend nonlocal games to allow quantum questions and answers, using quantum sets (special symmetric dagger Frobenius algebras) and the quantum functions of Musto, Reutter, and Verdon. Equations are presented using a diagrammatic calculus for tensor categories. To this quantum question and answer setting, we extend the standard definitions, including strategies, correlations, and synchronicity, and we use these definitions to extend results about synchronicity. We extend the graph homomorphism (isomorphism) game to quantum graphs, and show it is synchronous (bisynchronous) and connect its perfect (bi)strategies to quantum graph homomorphisms (isomorphisms). Our extended definitions agree with the existing quantum games literature, except in the case of synchronicity.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"8 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145962802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：