Pub Date : 2025-12-15DOI: 10.22331/q-2025-12-15-1946
Abhishek Chakraborty, Taylor L. Patti, Brucek Khailany, Andrew N. Jordan, Anima Anandkumar
Effective Hamiltonian calculations for large quantum systems can be both analytically intractable and numerically expensive using standard techniques. In this manuscript, we present numerical techniques inspired by Nonperturbative Analytical Diagonalization (NPAD) and the Magnus expansion for the efficient calculation of effective Hamiltonians. While these tools are appropriate for a wide array of applications, we here demonstrate their utility for models that can be realized in circuit-QED settings. Our numerical techniques are available as an open-source Python package, $text{qCH}_text{eff}$, which is available on GitHub and PyPI. We use the CuPy library for GPU-acceleration and report up to 15x speedup on GPU over CPU for NPAD, and up to 42x speedup for the Magnus expansion (compared to QuTiP), for large system sizes.
{"title":"GPU-accelerated Effective Hamiltonian Calculator","authors":"Abhishek Chakraborty, Taylor L. Patti, Brucek Khailany, Andrew N. Jordan, Anima Anandkumar","doi":"10.22331/q-2025-12-15-1946","DOIUrl":"https://doi.org/10.22331/q-2025-12-15-1946","url":null,"abstract":"Effective Hamiltonian calculations for large quantum systems can be both analytically intractable and numerically expensive using standard techniques. In this manuscript, we present numerical techniques inspired by Nonperturbative Analytical Diagonalization (NPAD) and the Magnus expansion for the efficient calculation of effective Hamiltonians. While these tools are appropriate for a wide array of applications, we here demonstrate their utility for models that can be realized in circuit-QED settings. Our numerical techniques are available as an open-source Python package, $text{qCH}_text{eff}$, which is available on GitHub and PyPI. We use the CuPy library for GPU-acceleration and report up to 15x speedup on GPU over CPU for NPAD, and up to 42x speedup for the Magnus expansion (compared to QuTiP), for large system sizes.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"29 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145753240","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 : 2025-12-12DOI: 10.22331/q-2025-12-12-1941
Ian George, Jie Lin, Thomas van Himbeeck, Kun Fang, Norbert Lütkenhaus
The Entropy Accumulation Theorem (EAT) was introduced to significantly improve the finite-size rates for device-independent quantum information processing tasks such as device-independent quantum key distribution (QKD). A natural question would be whether it also improves the rates for device-dependent QKD. In this work, we provide an affirmative answer to this question. We present new tools for applying the EAT in the device-dependent setting. We present sufficient conditions for the Markov chain conditions to hold as well as general algorithms for constructing the needed min-tradeoff function. Utilizing Dupuis' recent privacy amplification without smoothing result, we improve the key rate by optimizing the sandwiched Rényi entropy directly rather than considering the traditional smooth min-entropy. We exemplify these new tools by considering several examples including the BB84 protocol with the qubit-based version and with a realistic parametric down-conversion source, the six-state four-state protocol and a high-dimensional analog of the BB84 protocol.
{"title":"Finite-Key Analysis of Quantum Key Distribution with Characterized Devices Using Entropy Accumulation","authors":"Ian George, Jie Lin, Thomas van Himbeeck, Kun Fang, Norbert Lütkenhaus","doi":"10.22331/q-2025-12-12-1941","DOIUrl":"https://doi.org/10.22331/q-2025-12-12-1941","url":null,"abstract":"The Entropy Accumulation Theorem (EAT) was introduced to significantly improve the finite-size rates for device-independent quantum information processing tasks such as device-independent quantum key distribution (QKD). A natural question would be whether it also improves the rates for device-dependent QKD. In this work, we provide an affirmative answer to this question. We present new tools for applying the EAT in the device-dependent setting. We present sufficient conditions for the Markov chain conditions to hold as well as general algorithms for constructing the needed min-tradeoff function. Utilizing Dupuis' recent privacy amplification without smoothing result, we improve the key rate by optimizing the sandwiched Rényi entropy directly rather than considering the traditional smooth min-entropy. We exemplify these new tools by considering several examples including the BB84 protocol with the qubit-based version and with a realistic parametric down-conversion source, the six-state four-state protocol and a high-dimensional analog of the BB84 protocol.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145728717","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 : 2025-12-12DOI: 10.22331/q-2025-12-12-1943
Boris Bourdoncle, Pierre-Emmanuel Emeriau, Paul Hilaire, Shane Mansfield, Luka Music, Stephen Wein
Secure Delegated Quantum Computation (SDQC) protocols are a vital piece of the future quantum information processing global architecture since they allow end-users to perform their valuable computations on remote quantum servers without fear that a malicious quantum service provider or an eavesdropper might acquire some information about their data or algorithm. They also allow end-users to check that their computation has been performed as they have specified it.
However, existing protocols all have drawbacks that limit their usage in the real world. Most require the client to either operate a single-qubit source or perform single-qubit measurements, thus requiring them to still have some quantum technological capabilities albeit restricted, or require the server to perform operations which are hard to implement on real hardware (e.g isolate single photons from laser pulses and polarisation-preserving photon-number quantum non-demolition measurements). Others remove the need for quantum communications entirely but this comes at a cost in terms of security guarantees and memory overhead on the server's side.
We present an SDQC protocol which drastically reduces the technological requirements of both the client and the server while providing information-theoretic composable security. More precisely, the client only manipulates an attenuated laser pulse, while the server only handles interacting quantum emitters with a structure capable of generating spin-photon entanglement. The quantum emitter acts as both a converter from coherent laser pulses to polarisation-encoded qubits and an entanglement generator. Such devices have recently been used to demonstrate the largest entangled photonic state to date, thus hinting at the readiness of our protocol for experimental implementations.
{"title":"Towards practical secure delegated quantum computing with semi-classical light","authors":"Boris Bourdoncle, Pierre-Emmanuel Emeriau, Paul Hilaire, Shane Mansfield, Luka Music, Stephen Wein","doi":"10.22331/q-2025-12-12-1943","DOIUrl":"https://doi.org/10.22331/q-2025-12-12-1943","url":null,"abstract":"Secure Delegated Quantum Computation (SDQC) protocols are a vital piece of the future quantum information processing global architecture since they allow end-users to perform their valuable computations on remote quantum servers without fear that a malicious quantum service provider or an eavesdropper might acquire some information about their data or algorithm. They also allow end-users to check that their computation has been performed as they have specified it.<br/>\u0000<br/> However, existing protocols all have drawbacks that limit their usage in the real world. Most require the client to either operate a single-qubit source or perform single-qubit measurements, thus requiring them to still have some quantum technological capabilities albeit restricted, or require the server to perform operations which are hard to implement on real hardware (e.g isolate single photons from laser pulses and polarisation-preserving photon-number quantum non-demolition measurements). Others remove the need for quantum communications entirely but this comes at a cost in terms of security guarantees and memory overhead on the server's side.<br/>\u0000<br/> We present an SDQC protocol which drastically reduces the technological requirements of both the client and the server while providing information-theoretic composable security. More precisely, the client only manipulates an attenuated laser pulse, while the server only handles interacting quantum emitters with a structure capable of generating spin-photon entanglement. The quantum emitter acts as both a converter from coherent laser pulses to polarisation-encoded qubits and an entanglement generator. Such devices have recently been used to demonstrate the largest entangled photonic state to date, thus hinting at the readiness of our protocol for experimental implementations.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"37 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145728713","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 : 2025-12-12DOI: 10.22331/q-2025-12-12-1942
Chenfeng Cao, Yeqing Zhou, Swamit Tannu, Nic Shannon, Robert Joynt
Variational quantum algorithms (VQAs) represent a promising pathway toward achieving practical quantum advantage on near-term hardware. Despite this promise, for generic, expressive ansätze, their scalability is critically hindered by barren plateaus–regimes of exponentially vanishing gradients. We demonstrate that initializing a hardware-efficient, Floquet-structured ansatz within the many-body localized (MBL) phase mitigates barren plateaus and enhances algorithmic trainability. Through analysis of the inverse participation ratio, entanglement entropy, and a novel low-weight stabilizer Rényi entropy, we characterize a distinct MBL-thermalization transition. Below a critical kick strength, the circuit avoids forming a unitary 2-design, exhibits robust area-law entanglement, and maintains non-vanishing gradients. Leveraging this MBL regime facilitates the efficient variational preparation of ground states for several model Hamiltonians with significantly reduced computational resources. Crucially, experiments on a 127-qubit superconducting processor provide evidence for the preservation of trainable gradients in the MBL phase for a kicked Heisenberg chain, validating our approach on contemporary noisy hardware. Our findings position MBL-based initialization as a viable strategy for developing scalable VQAs and motivate broader integration of localization into quantum algorithm design.
{"title":"Exploiting many-body localization for scalable variational quantum simulation","authors":"Chenfeng Cao, Yeqing Zhou, Swamit Tannu, Nic Shannon, Robert Joynt","doi":"10.22331/q-2025-12-12-1942","DOIUrl":"https://doi.org/10.22331/q-2025-12-12-1942","url":null,"abstract":"Variational quantum algorithms (VQAs) represent a promising pathway toward achieving practical quantum advantage on near-term hardware. Despite this promise, for generic, expressive ansätze, their scalability is critically hindered by barren plateaus–regimes of exponentially vanishing gradients. We demonstrate that initializing a hardware-efficient, Floquet-structured ansatz within the many-body localized (MBL) phase mitigates barren plateaus and enhances algorithmic trainability. Through analysis of the inverse participation ratio, entanglement entropy, and a novel low-weight stabilizer Rényi entropy, we characterize a distinct MBL-thermalization transition. Below a critical kick strength, the circuit avoids forming a unitary 2-design, exhibits robust area-law entanglement, and maintains non-vanishing gradients. Leveraging this MBL regime facilitates the efficient variational preparation of ground states for several model Hamiltonians with significantly reduced computational resources. Crucially, experiments on a 127-qubit superconducting processor provide evidence for the preservation of trainable gradients in the MBL phase for a kicked Heisenberg chain, validating our approach on contemporary noisy hardware. Our findings position MBL-based initialization as a viable strategy for developing scalable VQAs and motivate broader integration of localization into quantum algorithm design.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"7 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145728766","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}
We present a finite-size security proof of the decoy-state BB84 QKD protocol against coherent attacks, using entropic uncertainty relations, for imperfect detectors. We apply this result to the case of detectors with imperfectly characterized basis-efficiency mismatch. Our proof works by obtaining a suitable bound on the phase error rate, without requiring any new modifications to the protocol steps or hardware. It is applicable to imperfectly characterized detectors, and only requires the maximum relative difference in detection efficiencies and dark count rates of the detectors to be characterized. Moreover, our proof allows Eve to choose detector efficiencies and dark count rates in their allowed ranges in each round, thereby addressing an important problem of detector side channels. We prove security in the variable-length framework, where users are allowed to adaptively determine the length of key to be produced, and number of bits to be used for error-correction, based on observations made during the protocol. We quantitatively demonstrate the effect of basis-efficiency mismatch by applying our results to the decoy-state BB84 protocol.
{"title":"Phase error rate estimation in QKD with imperfect detectors","authors":"Devashish Tupkary, Shlok Nahar, Pulkit Sinha, Norbert Lütkenhaus","doi":"10.22331/q-2025-12-11-1937","DOIUrl":"https://doi.org/10.22331/q-2025-12-11-1937","url":null,"abstract":"We present a finite-size security proof of the decoy-state BB84 QKD protocol against coherent attacks, using entropic uncertainty relations, for imperfect detectors. We apply this result to the case of detectors with imperfectly characterized basis-efficiency mismatch. Our proof works by obtaining a suitable bound on the phase error rate, without requiring any new modifications to the protocol steps or hardware. It is applicable to imperfectly characterized detectors, and only requires the maximum relative difference in detection efficiencies and dark count rates of the detectors to be characterized. Moreover, our proof allows Eve to choose detector efficiencies and dark count rates in their allowed ranges in each round, thereby addressing an important problem of detector side channels. We prove security in the variable-length framework, where users are allowed to adaptively determine the length of key to be produced, and number of bits to be used for error-correction, based on observations made during the protocol. We quantitatively demonstrate the effect of basis-efficiency mismatch by applying our results to the decoy-state BB84 protocol.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"58 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145718447","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 : 2025-12-11DOI: 10.22331/q-2025-12-11-1938
Jorge Tabanera-Bravo, Aljaz Godec
The detection and quantification of non-Markovianity, a.k.a. memory, in quantum systems is a central problem in the theory of open quantum systems. There memory is as a result of the interaction between the system and its environment. Little is known, however, about memory effects induced by imperfect measurements on closed systems, where an entanglement with the environment is not possible. We investigate the emergence and characteristics of memory in closed systems observed via imperfect stroboscopic quantum measurements yielding coarse-grained outcomes. We consider ideal and two kinds of imperfect measurements: von Neumann measurements–the analogue of classical lumping–which destroy any coherence in the system, and $textit{genuinely quantum-lumping}$ Lüders measurements preserving certain quantum correlations. Whereas the conditions for Markov dynamics under von Neumann lumping are the same as for classical dynamics, quantum-lumping requires stronger conditions, i.e. the absence of any detectable coherence. We introduce the concept of $textit{purely quantum memory}$ having no classical counterpart. We illustrate our results with a quantum walk on a lattice and discuss their implications for dissipative dynamics and decoherence effects induced by more realistic measurements.
{"title":"Purely quantum memory in closed systems observed via imperfect measurements","authors":"Jorge Tabanera-Bravo, Aljaz Godec","doi":"10.22331/q-2025-12-11-1938","DOIUrl":"https://doi.org/10.22331/q-2025-12-11-1938","url":null,"abstract":"The detection and quantification of non-Markovianity, a.k.a. memory, in quantum systems is a central problem in the theory of open quantum systems. There memory is as a result of the interaction between the system and its environment. Little is known, however, about memory effects induced by imperfect measurements on closed systems, where an entanglement with the environment is not possible. We investigate the emergence and characteristics of memory in closed systems observed via imperfect stroboscopic quantum measurements yielding coarse-grained outcomes. We consider ideal and two kinds of imperfect measurements: von Neumann measurements–the analogue of classical lumping–which destroy any coherence in the system, and $textit{genuinely quantum-lumping}$ Lüders measurements preserving certain quantum correlations. Whereas the conditions for Markov dynamics under von Neumann lumping are the same as for classical dynamics, quantum-lumping requires stronger conditions, i.e. the absence of any detectable coherence. We introduce the concept of $textit{purely quantum memory}$ having no classical counterpart. We illustrate our results with a quantum walk on a lattice and discuss their implications for dissipative dynamics and decoherence effects induced by more realistic measurements.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"15 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145718448","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 : 2025-12-11DOI: 10.22331/q-2025-12-11-1940
Jeongwan Haah
(i) We point out that every local unitary circuit of depth smaller than the linear system size is easily distinguished from a global Haar random unitary if there is a conserved quantity that is a sum of local operators. This is always the case with a continuous onsite symmetry or with a local energy conservation law. (ii) We explain a simple algorithm for a formulation of the shallow unitary circuit learning problem and relate it to an open question on strictly locality-preserving unitaries (quantum cellular automata). (iii) We show that any translation-invariant quantum cellular automaton in $D$-dimensional lattice of volume $V$ can be implemented using only $O(V)$ local gates in a staircase fashion using invertible subalgebra pumping.
{"title":"Short remarks on shallow unitary circuits","authors":"Jeongwan Haah","doi":"10.22331/q-2025-12-11-1940","DOIUrl":"https://doi.org/10.22331/q-2025-12-11-1940","url":null,"abstract":"(i) We point out that every local unitary circuit of depth smaller than the linear system size is easily distinguished from a global Haar random unitary if there is a conserved quantity that is a sum of local operators. This is always the case with a continuous onsite symmetry or with a local energy conservation law. (ii) We explain a simple algorithm for a formulation of the shallow unitary circuit learning problem and relate it to an open question on strictly locality-preserving unitaries (quantum cellular automata). (iii) We show that any translation-invariant quantum cellular automaton in $D$-dimensional lattice of volume $V$ can be implemented using only $O(V)$ local gates in a staircase fashion using invertible subalgebra pumping.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"19 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145718452","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 : 2025-12-11DOI: 10.22331/q-2025-12-11-1936
Dripto M. Debroy, Matt McEwen, Craig Gidney, Noah Shutty, Adam Zalcman
Recently, usage of detecting regions facilitated the discovery of new circuits for fault-tolerantly implementing the surface code. Building on these ideas, we present LUCI, a framework for constructing fault-tolerant circuits flexible enough to construct aperiodic and anisotropic circuits, making it a clear step towards quantum error correction beyond static codes. We show that LUCI can be used to adapt surface code circuits to lattices with imperfect qubit and coupler yield, a key challenge for fault-tolerant quantum computers using solid-state architectures. These circuits preserve spacelike distance for isolated broken couplers or isolated broken measure qubits in exchange for halving timelike distance, substantially reducing the penalty for dropout compared to the state of the art and creating opportunities in device architecture design. For qubit and coupler dropout rates of 1% and a patch diameter of 15, LUCI achieves an average spacelike distance of 13.1, compared to 9.1 for the best method in the literature. For a SI1000(0.001) circuit noise model, this translates to a 36x improvement in median logical error rate per round, a factor which increases with device performance. At these dropout and error rates, LUCI requires roughly 25% fewer physical qubits to reach algorithmically relevant one-in-a-trillion logical codeblock error rates.
{"title":"LUCI in the Surface Code with Dropouts","authors":"Dripto M. Debroy, Matt McEwen, Craig Gidney, Noah Shutty, Adam Zalcman","doi":"10.22331/q-2025-12-11-1936","DOIUrl":"https://doi.org/10.22331/q-2025-12-11-1936","url":null,"abstract":"Recently, usage of detecting regions facilitated the discovery of new circuits for fault-tolerantly implementing the surface code. Building on these ideas, we present LUCI, a framework for constructing fault-tolerant circuits flexible enough to construct aperiodic and anisotropic circuits, making it a clear step towards quantum error correction beyond static codes. We show that LUCI can be used to adapt surface code circuits to lattices with imperfect qubit and coupler yield, a key challenge for fault-tolerant quantum computers using solid-state architectures. These circuits preserve spacelike distance for isolated broken couplers or isolated broken measure qubits in exchange for halving timelike distance, substantially reducing the penalty for dropout compared to the state of the art and creating opportunities in device architecture design. For qubit and coupler dropout rates of 1% and a patch diameter of 15, LUCI achieves an average spacelike distance of 13.1, compared to 9.1 for the best method in the literature. For a SI1000(0.001) circuit noise model, this translates to a 36x improvement in median logical error rate per round, a factor which increases with device performance. At these dropout and error rates, LUCI requires roughly 25% fewer physical qubits to reach algorithmically relevant one-in-a-trillion logical codeblock error rates.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"150 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145718461","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 : 2025-12-11DOI: 10.22331/q-2025-12-11-1939
X. T. Yan, S. Kannan, Y. S. Athreya, A. G. Truscott, S. S. Hodgman
We propose a Bell test experiment using momentum-entangled atom pairs of different masses, specifically metastable helium isotopes ${}^{3}He^{*}$ and ${}^{4}He^{*}$, though the method extends to other atom species. Entanglement is generated via collisions, after which the quantum states are manipulated using two independent atom interferometers, enabling precise phase control over each species. Numerical simulations predict a significant violation of Bell's inequality under realistic conditions. This proposal opens a new paradigm to study the intersection of quantum mechanics and gravity.
{"title":"Proposal for a Bell Test with Entangled Atoms of Different Mass","authors":"X. T. Yan, S. Kannan, Y. S. Athreya, A. G. Truscott, S. S. Hodgman","doi":"10.22331/q-2025-12-11-1939","DOIUrl":"https://doi.org/10.22331/q-2025-12-11-1939","url":null,"abstract":"We propose a Bell test experiment using momentum-entangled atom pairs of different masses, specifically metastable helium isotopes ${}^{3}He^{*}$ and ${}^{4}He^{*}$, though the method extends to other atom species. Entanglement is generated via collisions, after which the quantum states are manipulated using two independent atom interferometers, enabling precise phase control over each species. Numerical simulations predict a significant violation of Bell's inequality under realistic conditions. This proposal opens a new paradigm to study the intersection of quantum mechanics and gravity.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"112 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145718472","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 : 2025-12-10DOI: 10.22331/q-2025-12-10-1933
Jan Perina Jr., Kishore Thapliyal, Grzegorz Chimczak, Anna Kowalewska-Kudlaszyk, Adam Miranowicz
We analyze the existence and degeneracies of quantum exceptional, diabolical, and hybrid points in simple bosonic systems – comprising up to six modes with damping and/or amplification – under two complementary scenarios to those described in arXiv:2405.01666: (i) nonconventional PT-symmetric dynamics confined to a subspace of the full Liouville space, and (ii) systems featuring unidirectional coupling. The system dynamics described by quadratic non-Hermitian Hamiltonians is governed by the Heisenberg-Langevin equations. Conditions for the observation of inherited quantum hybrid points with up to sixth-order exceptional and second-order diabolical degeneracies are revealed, though relevant only for short-time dynamics. This raises the question of whether higher-order inherited singularities exist in bosonic systems under general conditions. Nevertheless, for short times, unidirectional coupling of various types enables the concatenation of simple bosonic systems with second- and third-order exceptional degeneracies such that arbitrarily high exceptional degeneracies are reached. Methods for numerical identifying the quantum exceptional and hybrid points together with their degeneracies are addressed. Following arXiv:2405.01666 rich dynamics of second-order field-operator moments is analyzed from the point of view of the presence of exceptional and diabolical points and their degeneracies.
{"title":"Multiple quantum exceptional, diabolical, and hybrid points in multimode bosonic systems: II. Nonconventional PT-symmetric dynamics and unidirectional coupling","authors":"Jan Perina Jr., Kishore Thapliyal, Grzegorz Chimczak, Anna Kowalewska-Kudlaszyk, Adam Miranowicz","doi":"10.22331/q-2025-12-10-1933","DOIUrl":"https://doi.org/10.22331/q-2025-12-10-1933","url":null,"abstract":"We analyze the existence and degeneracies of quantum exceptional, diabolical, and hybrid points in simple bosonic systems – comprising up to six modes with damping and/or amplification – under two complementary scenarios to those described in arXiv:2405.01666: (i) nonconventional PT-symmetric dynamics confined to a subspace of the full Liouville space, and (ii) systems featuring unidirectional coupling. The system dynamics described by quadratic non-Hermitian Hamiltonians is governed by the Heisenberg-Langevin equations. Conditions for the observation of inherited quantum hybrid points with up to sixth-order exceptional and second-order diabolical degeneracies are revealed, though relevant only for short-time dynamics. This raises the question of whether higher-order inherited singularities exist in bosonic systems under general conditions. Nevertheless, for short times, unidirectional coupling of various types enables the concatenation of simple bosonic systems with second- and third-order exceptional degeneracies such that arbitrarily high exceptional degeneracies are reached. Methods for numerical identifying the quantum exceptional and hybrid points together with their degeneracies are addressed. Following arXiv:2405.01666 rich dynamics of second-order field-operator moments is analyzed from the point of view of the presence of exceptional and diabolical points and their degeneracies.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"139 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145711534","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
扫码关注我们
求助内容：
应助结果提醒方式：