Pub Date : 2026-02-03DOI: 10.22331/q-2026-02-03-1995
Shuheng Liu, Qiongyi He, Marcus Huber, Giuseppe Vitagliano
Characterizing entanglement of systems composed of multiple particles is a very complex problem that is attracting increasing attention across different disciplines related to quantum physics. The task becomes even more complex when the particles have many accessible levels, i.e., they are of high dimension, which leads to a potentially high-dimensional multipartite entangled state. These are important resources for an ever-increasing number of tasks, especially when a network of parties needs to share highly entangled states, e.g., for communicating more efficiently and securely. For these applications, as well as for purely theoretical arguments, it is important to be able to certify both the high-dimensional and the genuine multipartite nature of entangled states, possibly based on simple measurements. Here we derive a novel method that achieves this and improves over typical entanglement witnesses like the fidelity with respect to states of a Greenberger-Horne-Zeilinger (GHZ) form, without needing more complex measurements. We test our condition on paradigmatic classes of high-dimensional multipartite entangled states like imperfect GHZ states with random noise, as well as on purely randomly chosen ones and find that, in comparison with other available criteria our method provides a significant advantage and is often also simpler to evaluate.
{"title":"Characterizing high-dimensional multipartite entanglement beyond Greenberger-Horne-Zeilinger fidelities","authors":"Shuheng Liu, Qiongyi He, Marcus Huber, Giuseppe Vitagliano","doi":"10.22331/q-2026-02-03-1995","DOIUrl":"https://doi.org/10.22331/q-2026-02-03-1995","url":null,"abstract":"Characterizing entanglement of systems composed of multiple particles is a very complex problem that is attracting increasing attention across different disciplines related to quantum physics. The task becomes even more complex when the particles have many accessible levels, i.e., they are of high dimension, which leads to a potentially high-dimensional multipartite entangled state. These are important resources for an ever-increasing number of tasks, especially when a network of parties needs to share highly entangled states, e.g., for communicating more efficiently and securely. For these applications, as well as for purely theoretical arguments, it is important to be able to certify both the high-dimensional and the genuine multipartite nature of entangled states, possibly based on simple measurements. Here we derive a novel method that achieves this and improves over typical entanglement witnesses like the fidelity with respect to states of a Greenberger-Horne-Zeilinger (GHZ) form, without needing more complex measurements. We test our condition on paradigmatic classes of high-dimensional multipartite entangled states like imperfect GHZ states with random noise, as well as on purely randomly chosen ones and find that, in comparison with other available criteria our method provides a significant advantage and is often also simpler to evaluate.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146101982","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-02-02DOI: 10.22331/q-2026-02-02-1993
Marco Radaelli, Joseph A. Smiga, Gabriel T. Landi, Felix C. Binder
We consider the estimation of parameters encoded in the measurement record of a continuously monitored quantum system in the jump unraveling, corresponding to a single-shot scenario, where information is continuously gathered. Here, it is generally difficult to assess the precision of the estimation procedure via the Fisher Information due to intricate temporal correlations and memory effects. In this paper we provide a full set of solutions to this problem. First, for multi-channel renewal processes we relate the Fisher Information to an underlying Markov chain and derive a easily computable expression for it. For non-renewal processes, we introduce a new algorithm that combines two methods: the monitoring operator method for metrology and the Gillespie algorithm which allows for efficient sampling of a stochastic form of the Fisher Information along individual quantum trajectories. We show that this stochastic Fisher Information satisfies useful properties related to estimation on a single run. Finally, we consider the case where some information is lost in data compression/post-selection and provide tools for computing the Fisher Information in this case. All scenarios are illustrated with instructive examples from quantum optics and condensed matter.
{"title":"Parameter estimation for quantum jump unraveling","authors":"Marco Radaelli, Joseph A. Smiga, Gabriel T. Landi, Felix C. Binder","doi":"10.22331/q-2026-02-02-1993","DOIUrl":"https://doi.org/10.22331/q-2026-02-02-1993","url":null,"abstract":"We consider the estimation of parameters encoded in the measurement record of a continuously monitored quantum system in the jump unraveling, corresponding to a single-shot scenario, where information is continuously gathered. Here, it is generally difficult to assess the precision of the estimation procedure via the Fisher Information due to intricate temporal correlations and memory effects. In this paper we provide a full set of solutions to this problem. First, for multi-channel renewal processes we relate the Fisher Information to an underlying Markov chain and derive a easily computable expression for it. For non-renewal processes, we introduce a new algorithm that combines two methods: the monitoring operator method for metrology and the Gillespie algorithm which allows for efficient sampling of a stochastic form of the Fisher Information along individual quantum trajectories. We show that this stochastic Fisher Information satisfies useful properties related to estimation on a single run. Finally, we consider the case where some information is lost in data compression/post-selection and provide tools for computing the Fisher Information in this case. All scenarios are illustrated with instructive examples from quantum optics and condensed matter.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"290 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146097948","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-30DOI: 10.22331/q-2026-01-30-1992
Guangze Chen, Anton Frisk Kockum
Quantum computation and quantum simulation require a versatile gate set to optimize circuit compilation for practical applications. However, existing platforms are often limited to specific gate types or rely on parametric couplers to extend their gate set, which compromises scalability. Here, we propose a scalable quantum simulator with an extended gate set based on giant-atom three-level systems, which can be implemented with superconducting circuits. Unlike conventional small atoms, giant atoms couple to the environment at multiple points, introducing interference effects that allow exceptional tunability of their interactions. By leveraging this tunability, our setup supports both CZ and iSWAP gates through simple frequency adjustments, eliminating the need for parametric couplers. This dual-gate capability enhances circuit efficiency, reducing the overhead for quantum simulation. As a demonstration, we showcase the simulation of spin dynamics in dissipative Heisenberg XXZ spin chains, highlighting the setup's ability to tackle complex open quantum many-body dynamics. Finally, we discuss how a two-dimensional extension of our system could enable fault-tolerant quantum computation, paving the way for a universal quantum processor.
{"title":"Scalable quantum simulator with an extended gate set in giant atoms","authors":"Guangze Chen, Anton Frisk Kockum","doi":"10.22331/q-2026-01-30-1992","DOIUrl":"https://doi.org/10.22331/q-2026-01-30-1992","url":null,"abstract":"Quantum computation and quantum simulation require a versatile gate set to optimize circuit compilation for practical applications. However, existing platforms are often limited to specific gate types or rely on parametric couplers to extend their gate set, which compromises scalability. Here, we propose a scalable quantum simulator with an extended gate set based on giant-atom three-level systems, which can be implemented with superconducting circuits. Unlike conventional small atoms, giant atoms couple to the environment at multiple points, introducing interference effects that allow exceptional tunability of their interactions. By leveraging this tunability, our setup supports both CZ and iSWAP gates through simple frequency adjustments, eliminating the need for parametric couplers. This dual-gate capability enhances circuit efficiency, reducing the overhead for quantum simulation. As a demonstration, we showcase the simulation of spin dynamics in dissipative Heisenberg XXZ spin chains, highlighting the setup's ability to tackle complex open quantum many-body dynamics. Finally, we discuss how a two-dimensional extension of our system could enable fault-tolerant quantum computation, paving the way for a universal quantum processor.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"8 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146073397","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-29DOI: 10.22331/q-2026-01-29-1991
Piotr Dulian, Stanisław Kurdziałek, Rafał Demkowicz-Dobrzański
QMetro++ is a Python package that provides a set of tools for identifying optimal estimation protocols that maximize quantum Fisher information (QFI). Optimization can be performed for arbitrary configurations of input states, parameter-encoding channels, noise correlations, control operations, and measurements. The use of tensor networks and an iterative see-saw algorithm allows for an efficient optimization even in the regime of a large number of channel uses ($Napprox100$). Additionally, the package includes implementations of the recently developed methods for computing fundamental upper bounds on QFI, which serve as benchmarks for assessing the optimality of numerical optimization results. All functionalities are wrapped up in a user-friendly interface which enables the definition of strategies at various levels of detail.
{"title":"QMetro++ – Python optimization package for large scale quantum metrology with customized strategy structures","authors":"Piotr Dulian, Stanisław Kurdziałek, Rafał Demkowicz-Dobrzański","doi":"10.22331/q-2026-01-29-1991","DOIUrl":"https://doi.org/10.22331/q-2026-01-29-1991","url":null,"abstract":"QMetro++ is a Python package that provides a set of tools for identifying optimal estimation protocols that maximize quantum Fisher information (QFI). Optimization can be performed for arbitrary configurations of input states, parameter-encoding channels, noise correlations, control operations, and measurements. The use of tensor networks and an iterative see-saw algorithm allows for an efficient optimization even in the regime of a large number of channel uses ($Napprox100$). Additionally, the package includes implementations of the recently developed methods for computing fundamental upper bounds on QFI, which serve as benchmarks for assessing the optimality of numerical optimization results. All functionalities are wrapped up in a user-friendly interface which enables the definition of strategies at various levels of detail.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"40 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146070422","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-28DOI: 10.22331/q-2026-01-28-1990
Antonis Delakouras, Georgios Doultsinos, David Petrosyan
We propose an efficient protocol to realize multi-qubit gates in arrays of neutral atoms. The atoms encode qubits in the long-lived hyperfine sublevels of the ground electronic state. To realize the gate, we apply a global laser pulse to transfer the atoms to a Rydberg state with strong blockade interaction that suppresses simultaneous excitation of neighboring atoms arranged in a star-graph configuration. The number of Rydberg excitations, and thereby the parity of the resulting state, depends on the multiqubit input state. Upon changing the sign of the interaction and de-exciting the atoms with an identical laser pulse, the system acquires a geometric phase that depends only on the parity of the excited state, while the dynamical phase is completely canceled. Using single qubit rotations, this transformation can be converted to the C$_k$Z or C$_k$NOT quantum gate for $k+1$ atoms. We also present extensions of the scheme to implement quantum gates between distant atomic qubits connected by a quantum bus consisting of a chain of atoms.
{"title":"Multi-qubit Rydberg gates between distant atoms","authors":"Antonis Delakouras, Georgios Doultsinos, David Petrosyan","doi":"10.22331/q-2026-01-28-1990","DOIUrl":"https://doi.org/10.22331/q-2026-01-28-1990","url":null,"abstract":"We propose an efficient protocol to realize multi-qubit gates in arrays of neutral atoms. The atoms encode qubits in the long-lived hyperfine sublevels of the ground electronic state. To realize the gate, we apply a global laser pulse to transfer the atoms to a Rydberg state with strong blockade interaction that suppresses simultaneous excitation of neighboring atoms arranged in a star-graph configuration. The number of Rydberg excitations, and thereby the parity of the resulting state, depends on the multiqubit input state. Upon changing the sign of the interaction and de-exciting the atoms with an identical laser pulse, the system acquires a geometric phase that depends only on the parity of the excited state, while the dynamical phase is completely canceled. Using single qubit rotations, this transformation can be converted to the C$_k$Z or C$_k$NOT quantum gate for $k+1$ atoms. We also present extensions of the scheme to implement quantum gates between distant atomic qubits connected by a quantum bus consisting of a chain of atoms.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"38 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146056991","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-28DOI: 10.22331/q-2026-01-28-1988
Ties-Albrecht Ohst, Shijun Zhang, Hai Chau Nguyen, Martin Plávala, Marco Túlio Quintino
Quantum memories are a crucial precondition in many protocols for processing quantum information. A fundamental problem that illustrates this statement is given by the task of channel discrimination, in which an unknown channel drawn from a known random ensemble should be determined by applying it for a single time. In this paper, we characterise the quality of channel discrimination protocols when the quantum memory, quantified by the auxiliary dimension, is limited. This is achieved by formulating the problem in terms of separable quantum states with additional affine constraints that all of their factors in each separable decomposition obey. We discuss the computation of upper and lower bounds to the solutions of such problems which allow for new insights into the role of memory in channel discrimination. In addition to the single-copy scenario, this methodological insight allows to systematically characterise quantum and classical memories in adaptive channel discrimination protocols. Especially, our methods enabled us to identify channel discrimination scenarios where classical or quantum memory is required, and to identify the hierarchical and non-hierarchical relationships within adaptive channel discrimination protocols.
{"title":"Characterising memory in quantum channel discrimination via constrained separability problems","authors":"Ties-Albrecht Ohst, Shijun Zhang, Hai Chau Nguyen, Martin Plávala, Marco Túlio Quintino","doi":"10.22331/q-2026-01-28-1988","DOIUrl":"https://doi.org/10.22331/q-2026-01-28-1988","url":null,"abstract":"Quantum memories are a crucial precondition in many protocols for processing quantum information. A fundamental problem that illustrates this statement is given by the task of channel discrimination, in which an unknown channel drawn from a known random ensemble should be determined by applying it for a single time. In this paper, we characterise the quality of channel discrimination protocols when the quantum memory, quantified by the auxiliary dimension, is limited. This is achieved by formulating the problem in terms of separable quantum states with additional affine constraints that all of their factors in each separable decomposition obey. We discuss the computation of upper and lower bounds to the solutions of such problems which allow for new insights into the role of memory in channel discrimination. In addition to the single-copy scenario, this methodological insight allows to systematically characterise quantum and classical memories in adaptive channel discrimination protocols. Especially, our methods enabled us to identify channel discrimination scenarios where classical or quantum memory is required, and to identify the hierarchical and non-hierarchical relationships within adaptive channel discrimination protocols.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"274 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146056987","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-28DOI: 10.22331/q-2026-01-28-1989
Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman
Mančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al. [JCTB'19] proved that quantum isomorphism is undecidable in general, which motivates the study of its relaxations. In the classical setting, Roberson and Seppelt [ICALP'23] characterized the feasibility of each level of the Lasserre hierarchy of semidefinite programming relaxations of graph isomorphism in terms of equality of homomorphism counts from an appropriate graph class. The NPA hierarchy, a noncommutative generalization of the Lasserre hierarchy, provides a sequence of semidefinite programming relaxations for quantum isomorphism. In the quantum setting, we show that the feasibility of each level of the NPA hierarchy for quantum isomorphism is equivalent to equality of homomorphism counts from an appropriate class of planar graphs. Combining this characterization with the convergence of the NPA hierarchy, and noting that the union of these classes is the set of all planar graphs, we obtain a new proof of the result of Mančinska and Roberson [FOCS'20] that avoids the use of quantum groups. Moreover, this homomorphism indistinguishability characterization also yields a randomized polynomial-time algorithm deciding exact feasibility of each fixed level of the NPA hierarchy of SDP relaxations for quantum isomorphism.
man inska和Roberson [FOCS'20]证明了两个图是量子同构的当且仅当它们承认来自任意平面图的同态数相同。Atserias等[JCTB'19]证明了量子同构在一般情况下是不可确定的，这激发了对其松弛的研究。在经典设置中，Roberson和Seppelt [ICALP'23]根据适当图类的同态数相等性，表征了图同构的半定规划松弛的Lasserre层次的每一层的可行性。NPA层次是Lasserre层次的非交换推广，为量子同构提供了一组半定规划松弛。在量子环境下，我们证明了NPA层次的每一层对于量子同构的可行性等价于一个适当的平面图的同态计数的相等性。将这种表征与NPA层次的收敛性结合起来，并注意到这些类的并集是所有平面图的集合，我们得到了man因斯卡和罗伯逊[FOCS'20]避免使用量子群的结果的新证明。此外，这种同态不可区分特性还产生了一种随机多项式时间算法，用于确定量子同态的SDP弛豫的NPA层次的每个固定水平的精确可行性。
{"title":"NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability","authors":"Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman","doi":"10.22331/q-2026-01-28-1989","DOIUrl":"https://doi.org/10.22331/q-2026-01-28-1989","url":null,"abstract":"Mančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al. [JCTB'19] proved that quantum isomorphism is undecidable in general, which motivates the study of its relaxations. In the classical setting, Roberson and Seppelt [ICALP'23] characterized the feasibility of each level of the Lasserre hierarchy of semidefinite programming relaxations of graph isomorphism in terms of equality of homomorphism counts from an appropriate graph class. The NPA hierarchy, a noncommutative generalization of the Lasserre hierarchy, provides a sequence of semidefinite programming relaxations for quantum isomorphism. In the quantum setting, we show that the feasibility of each level of the NPA hierarchy for quantum isomorphism is equivalent to equality of homomorphism counts from an appropriate class of planar graphs. Combining this characterization with the convergence of the NPA hierarchy, and noting that the union of these classes is the set of all planar graphs, we obtain a new proof of the result of Mančinska and Roberson [FOCS'20] that avoids the use of quantum groups. Moreover, this homomorphism indistinguishability characterization also yields a randomized polynomial-time algorithm deciding exact feasibility of each fixed level of the NPA hierarchy of SDP relaxations for quantum isomorphism.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"117 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146056985","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-27DOI: 10.22331/q-2026-01-27-1986
Dong An, Akwum Onwunta, Gengzhi Yang
We establish improved complexity estimates of quantum algorithms for linear dissipative ordinary differential equations (ODEs) and show that the time dependence can be fast-forwarded to be sub-linear. Specifically, we show that a quantum algorithm based on truncated Dyson series can prepare history states of dissipative ODEs up to time $T$ with cost $widetilde{mathcal{O}}(log(T) (log(1/epsilon))^2 )$, which is an exponential speedup over the best previous result. For final state preparation at time $T$, we show that its complexity is $widetilde{mathcal{O}}(sqrt{T} (log(1/epsilon))^2 )$, achieving a polynomial speedup in $T$. We also analyze the complexity of simpler lower-order quantum algorithms, such as the forward Euler method and the trapezoidal rule, and find that even lower-order methods can still achieve $widetilde{mathcal{O}}(sqrt{T})$ cost with respect to time $T$ for preparing final states of dissipative ODEs. As applications, we show that quantum algorithms can simulate dissipative non-Hermitian quantum dynamics and heat processes with fast-forwarded complexity sub-linear in time.
{"title":"Fast-forwarding quantum algorithms for linear dissipative differential equations","authors":"Dong An, Akwum Onwunta, Gengzhi Yang","doi":"10.22331/q-2026-01-27-1986","DOIUrl":"https://doi.org/10.22331/q-2026-01-27-1986","url":null,"abstract":"We establish improved complexity estimates of quantum algorithms for linear dissipative ordinary differential equations (ODEs) and show that the time dependence can be fast-forwarded to be sub-linear. Specifically, we show that a quantum algorithm based on truncated Dyson series can prepare history states of dissipative ODEs up to time $T$ with cost $widetilde{mathcal{O}}(log(T) (log(1/epsilon))^2 )$, which is an exponential speedup over the best previous result. For final state preparation at time $T$, we show that its complexity is $widetilde{mathcal{O}}(sqrt{T} (log(1/epsilon))^2 )$, achieving a polynomial speedup in $T$. We also analyze the complexity of simpler lower-order quantum algorithms, such as the forward Euler method and the trapezoidal rule, and find that even lower-order methods can still achieve $widetilde{mathcal{O}}(sqrt{T})$ cost with respect to time $T$ for preparing final states of dissipative ODEs. As applications, we show that quantum algorithms can simulate dissipative non-Hermitian quantum dynamics and heat processes with fast-forwarded complexity sub-linear in time.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"87 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146048686","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-27DOI: 10.22331/q-2026-01-27-1985
Felix Fischer, Daniel Burgarth, Davide Lonigro
When numerically simulating the unitary time evolution of an infinite-dimensional quantum system, one is usually led to treat the Hamiltonian $H$ as an "infinite-dimensional matrix" by expressing it in some orthonormal basis of the Hilbert space, and then truncate it to some finite dimensions. However, the solutions of the Schrödinger equations generated by the truncated Hamiltonians need not converge, in general, to the solution of the Schrödinger equation corresponding to the actual Hamiltonian. In this paper we demonstrate that, under mild assumptions, they converge to the solution of the Schrödinger equation generated by a specific Hamiltonian which crucially depends on the particular choice of basis: the Friedrichs extension of the restriction of $H$ to the space of finite linear combinations of elements of the basis. Importantly, this is generally different from $H$ itself; in all such cases, numerical simulations will unavoidably reproduce the wrong dynamics in the limit, and yet there is no numerical test that can reveal this failure, unless one has the analytical solution to compare with. As a practical demonstration of such results, we consider the quantum particle in the box, and we show that, for a wide class of bases (which include associated Legendre polynomials as a concrete example) the dynamics generated by the truncated Hamiltonians will always converge to the one corresponding to the particle with Dirichlet boundary conditions, regardless the initial choice of boundary conditions. Other such examples are discussed.
{"title":"Quantum particle in the wrong box (or: the perils of finite-dimensional approximations)","authors":"Felix Fischer, Daniel Burgarth, Davide Lonigro","doi":"10.22331/q-2026-01-27-1985","DOIUrl":"https://doi.org/10.22331/q-2026-01-27-1985","url":null,"abstract":"When numerically simulating the unitary time evolution of an infinite-dimensional quantum system, one is usually led to treat the Hamiltonian $H$ as an \"infinite-dimensional matrix\" by expressing it in some orthonormal basis of the Hilbert space, and then truncate it to some finite dimensions. However, the solutions of the Schrödinger equations generated by the truncated Hamiltonians need not converge, in general, to the solution of the Schrödinger equation corresponding to the actual Hamiltonian.<br/> In this paper we demonstrate that, under mild assumptions, they converge to the solution of the Schrödinger equation generated by a specific Hamiltonian which crucially depends on the particular choice of basis: the Friedrichs extension of the restriction of $H$ to the space of finite linear combinations of elements of the basis. Importantly, this is generally different from $H$ itself; in all such cases, numerical simulations will unavoidably reproduce the wrong dynamics in the limit, and yet there is no numerical test that can reveal this failure, unless one has the analytical solution to compare with.<br/> As a practical demonstration of such results, we consider the quantum particle in the box, and we show that, for a wide class of bases (which include associated Legendre polynomials as a concrete example) the dynamics generated by the truncated Hamiltonians will always converge to the one corresponding to the particle with Dirichlet boundary conditions, regardless the initial choice of boundary conditions. Other such examples are discussed.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"72 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146048878","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-27DOI: 10.22331/q-2026-01-27-1987
David Cui, Giulio Malavolta, Arthur Mehta, Anand Natarajan, Connor Paddock, Simon Schmidt, Michael Walter, Tina Zhang
Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work, we continue the study initiated by Kalai et al. (STOC '23) of compiled nonlocal games, played between a classical verifier and a single cryptographically limited quantum device. Our main result is that the compiler proposed by Kalai et al. is sound for any two-player XOR game. A celebrated theorem of Tsirelson shows that for XOR games, the quantum value is exactly given by a semidefinite program, and we obtain our result by showing that the SDP upper bound holds for the compiled game up to a negligible error arising from the compilation. This answers a question raised by Natarajan and Zhang (FOCS '23), who showed soundness for the specific case of the CHSH game. Using our techniques, we obtain several additional results, including (1) tight bounds on the compiled value of parallel-repeated XOR games, (2) operator self-testing statements for any compiled XOR game, and (3) a “nice'' sum-of-squares certificate for any XOR game, from which operator rigidity is manifest.
{"title":"A Computational Tsirelson’s Theorem for the Value of Compiled XOR Games","authors":"David Cui, Giulio Malavolta, Arthur Mehta, Anand Natarajan, Connor Paddock, Simon Schmidt, Michael Walter, Tina Zhang","doi":"10.22331/q-2026-01-27-1987","DOIUrl":"https://doi.org/10.22331/q-2026-01-27-1987","url":null,"abstract":"Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work, we continue the study initiated by Kalai et al. (STOC '23) of compiled nonlocal games, played between a classical verifier and a single cryptographically limited quantum device. Our main result is that the compiler proposed by Kalai et al. is sound for any two-player XOR game. A celebrated theorem of Tsirelson shows that for XOR games, the quantum value is exactly given by a semidefinite program, and we obtain our result by showing that the SDP upper bound holds for the compiled game up to a negligible error arising from the compilation. This answers a question raised by Natarajan and Zhang (FOCS '23), who showed soundness for the specific case of the CHSH game. Using our techniques, we obtain several additional results, including (1) tight bounds on the compiled value of parallel-repeated XOR games, (2) operator self-testing statements for any compiled XOR game, and (3) a “nice'' sum-of-squares certificate for any XOR game, from which operator rigidity is manifest.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146048687","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
扫码关注我们
求助内容：
应助结果提醒方式：