Search arXiv⌕ Search

arXiv subjects

András Bodor

Publications and source records attributed to András Bodor.

9 recordsLinked to original sources

Beyond Gaussian Entanglement: Practical Criteria for Polynomially Excited Quantum States

Polynomial excitations consisting of creation and annihilation operators are studied. Subsystem entanglement is proven produced and preserved by such manipulations. NPT entanglement already present between any two subsystems of a general pure or mixed multipartite Gaussian state is preserved under all polynomial excitations. Nevertheless, these excitations can create NPT entanglement between initially separable subsystems, implying that the number of NPT entangled pairs cannot decrease. Polynomial excitations of a wide class of initially separable pure states are considered. For these states, the method reduces the infinite-dimensional positivity problem to a finite-dimensional one: after partial transposition, NPT entanglement is equivalent to a corresponding bilinear representation matrix not being positive semi-definite. Furthermore, using symplectic diagonalization and spectral decomposition, an explicit transformation is constructed between the Fock-space and position representations. It is applied to quadratic excitations of a three-mode mixed Gaussian state. The behavior of the NPT entanglement is tracked between subsystems as a function of a parameter $κ$, which tunes the non-locality of the excitation, and quantum negativity is evaluated. Under a chosen quadratic Hamiltonian, the resulting unitary time evolution maintains NPT entanglement for long intervals, interrupted only by short periods of PPT states. Finally, a closed analytical expression is derived for the covariance matrix of a general quadratic operator for an arbitrary number of degrees of freedom in phase space. Our framework directly connects mathematical foundations, theoretical modeling, and experimentally feasible implementations.

quant-ph↗

Quantitative comparison of quantum pseudo-telepathy games and Bell inequalities

Quantum pseudo-telepathy games, such as the Mermin-Peres magic square and the doily game, theoretically allow players to win with unit probability when using entangled quantum strategies. We quantitatively characterize the quantum advantage in these games and compare it with violations of two Bell inequalities: the Clauser-Horne-Shimony-Holt and the Collins-Gisin inequalities. The analysis is restricted to two families of two-qubit states: modified Werner states and Bell-diagonal states. For each case, we identify and quantify the regions of quantum state space that exhibit either a quantum advantage or a Bell inequality violation, relative to the set of all entangled states. Within these families, the doily game captures a larger fraction of entangled states than the Mermin-Peres magic square game, though both are significantly more limited than the regions associated with Bell inequality violations. Although both approaches are fundamentally linked to quantum contextuality, our analysis of the examined two-qubit state families indicates that Bell inequalities are more effective at revealing entanglement, even if pseudo-telepathy games offer a more intuitive and conceptually appealing perspective.

quant-ph↗

Simulating nonlocal no-signaling boxes

We present a computer framework to simulate two-party boxes that exhibit nonclassical no-signaling correlations through a Web-based application programming interface (RESTful Web API). Unlike real quantum-based correlations, the simulated ones are not instantaneous and are created via communication with a trusted server. They can, however, be useful in a number of applications, including e.g. teaching the use of nonlocal correlations, designing and testing infocommunication systems, and engineering software interfaces for new quantum hardware. We demonstrate the use of the API via the simple implementation of the Clauser-Horne-Shimony-Holt game. Up to our knowledge no such a framework has been implemented or proposed thus far.

quant-ph↗

Error-free interconversion of nonlocal boxes

Understanding the structure of nonlocal correlations is important in many fields ranging from fundamental questions of physics to device-independent cryptography. We present a protocol that can convert extremal two-party--two-input nonlocal no-signaling boxes of any type into any other extremal two-party--two-input nonlocal no-signaling box perfectly. Our results are exact, and even though the number of required boxes cannot be determined in advance, their expected number is finite. Our protocol is adaptive and demonstrates for the first time the usefulness of using no-signaling boxes in different causal orders by the parties.

quant-ph↗

Ex ante versus ex post equilibria in classical Bayesian games with a nonlocal resource

We analyze the difference between ex ante and ex post equilibria in classical games played with the assistance of a nonlocal (quantum or no-signaling) resource. In physics, the playing of these games is known as performing bipartite Bell-type experiments. By analyzing the Clauser-Horn-Shimony-Holt game, we find a constructive procedure to find two-person Bayesian games with a nonlocal (i.e. no-signaling, and, in many cases, quantum) advantage. Most games of this kind known from the literature can be constructed along this principle, and share the property that their relevant ex ante equilibria are ex post equilibria as well. We introduce a new type of game, based on the Bell-theorem by Vértesi and Bene, which does not have the latter property: the ex ante and ex post equilibria differ.

quant-ph↗

Efficient classification of billions of points into complex geographic regions using hierarchical triangular mesh

We present a case study about the spatial indexing and regional classification of billions of geographic coordinates from geo-tagged social network data using Hierarchical Triangular Mesh (HTM) implemented for Microsoft SQL Server. Due to the lack of certain features of the HTM library, we use it in conjunction with the GIS functions of SQL Server to significantly increase the efficiency of pre-filtering of spatial filter and join queries. For example, we implemented a new algorithm to compute the HTM tessellation of complex geographic regions and precomputed the intersections of HTM triangles and geographic regions for faster false-positive filtering. With full control over the index structure, HTM-based pre-filtering of simple containment searches outperforms SQL Server spatial indices by a factor of ten and HTM-based spatial joins run about a hundred times faster.

cs.DB↗

Non-Markovian Toy Quantum Chain

We propose a simple structure for stationary non-Markovian quantum chains in the framework of collisional dynamics of open quantum systems. To this end, we modify the microscopic Markovian system--reservoir model, consider multiple collisions with each of the molecules with an overlap between the collisional time intervals. We show how the equivalent Markovian quantum chain can be constructed with the addition of satellite quantum memory to the system. We distinguish quantum from classical non-Markovianity. Moreover, we define the counts of non-Markovianity by the required number of satellite qubits and bits, respectively. As the particular measure of quantum non-Markovianity the discord of the satellite w.r.t. the system is suggested. Simplest qubit realizations are discussed, and the significance for real system--environment dynamics is also pointed out.

quant-ph↗

On Conserved Current in Markovian Open Quantum Systems

We reexamine the markovian approximation of local current in open quantum systems, discussed recently by Gebauer and Car. Our derivation is more transparent, the proof of current conservation becomes explicit and easy.

quant-ph↗