The problem of identifiability of model parameters for open quantum systems is considered by investigating two-level dephasing systems. We discuss under which conditions full information about the Hamiltonian and dephasing parameters can be obtained. Using simulated experiments several different strategies for extracting model parameters from limited and noisy data are compared.
As combinatorial optimization is one of the main quantum computing applications, many methods based on parameterized quantum circuits are being developed. In general, a set of parameters are being tweaked to optimize a cost function out of the quantum circuit output. One of these algorithms, the Quantum Approximate Optimization Algorithm stands out as a promising approach to tackling combinatorial problems. However, finding the appropriate parameters is a difficult task. Although QAOA exhibits concentration properties, they can depend on instances characteristics that may not be easy to identi…
In this article, we provide theoretical support for the use of geometric measures of nonclassicality as a general tool to identify quantum phase transitions. We argue that divergences in the susceptibility of any geometric measure of nonclassicality are sufficient conditions to identify phase transitions at arbitrary temperature. This establishes that geometric measures of nonclassicality, in any quantum resource theory, are generic tools to investigate phase transitions in quantum systems. At zero temperature, we show that geometric measures of quantum coherence are especially useful for iden…
We propose a method to identify the order of a Quantum Phase Transition by using area measures of the ground state in phase space. We illustrate our proposal by analyzing the well known example of the Quantum Cusp, and four different paradigmatic boson models: Dicke, Lipkin-Meshkov-Glick, interacting boson model, and vibron model.
The multimode interference technique is a simple way to study the interference patterns found in many quantum probability distributions. We demonstrate that this analysis not only explains the existence of so-called "quantum carpets," but can explain the spatial distribution of channels and ridges in the carpets. With an understanding of the factors that govern these channels and ridges we have a limited ability to produce a particular pattern of channels and ridges by carefully choosing the weighting coefficients c_{n} . We also use these results to demonstrate why fractional revivals of init…
We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem are not restricted to be linear but can also be m-variate polynomial functions of total degree n>=2. The problem of identifying hidden m-variate polynomials of degree less or equal to n for fixed n and m is hard on a classical computer since Omega(sqrt{d}) black-box queries are required to guarantee a constant success probability. In contrast, we present a q…
The quantization of 2-players N-strategies games is considered. The general form of gate operator is determined under the assumption that the classical pure strategies are contained in the set of pure quantum ones.
Quantum teleportation is a method for utilizing quantum measurements and the maximally entangled Einstein-Podolsky-Rosen (EPR) pair to transmit an unknown quantum state. It is well known that all entangled states demonstrate so-called "nonclassical teleportation" that cannot be simulated by the seminal classical measure-prepare strategy. Herein, we propose a new benchmark which reveals that not all nonclassical teleportations are truly quantum-mechanical. Rather, there exists a more robust classical-teleportation model, which includes the measure-prepare mimicry as a special case, that can des…
We investigate the quantization of non-zero sum games. For the particular case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma if quantum strategies are allowed for. We also construct a particular quantum strategy which always gives reward if played against any classical strategy.
This work develops analytic methods to quantitatively demarcate quantum reality from its subset of classical phenomenon, as well as from the superset of general probabilistic theories. Regarding quantum nonlocality, we discuss how to determine the quantum limit of Bell-type linear inequalities. In contrast to semidefinite programming approaches, our method allows for the consideration of inequalities with abstract weights, by means of leveraging the Hermiticity of quantum states. Recognizing that classical correlations correspond to measurements made on separable states, we also introduce a pr…
In a recent paper, Eisert et al. presented a quantum mechanical generalization of Prisoner's Dilemma. They asserted that the maximally entangled game exhibits a unique Nash equilibrium which yields a pay-off equivalent to cooperative behaviour. In this comment we show that their observation is incorrect: there is no Nash equilibrium in the space of deterministic quantum strategies.
We present a quantum implementation of Parrondo's game with randomly switched strategies using 1) a quantum walk as a source of ``randomness'' and 2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum walk scheme.
We introduce and analyze a quantum analogue of the Law of Excluded Gambling Strategies of Classical Decision Theory by the definition of different kind of quantum casinos. The necessity of keeping into account entaglement (by the way we give a staightforward generalization of Schmidt's entanglement measure) forces us to adopt the general algebraic language of Quantum Probability Theory whose essential points are reviewed. The Mathematica code of two packages simulating, respectively, classical and quantum gambling is included. The deep link existing between the censorship of winning quantum ga…
In classical Monty Hall problem, one player can always win with probability 2/3. We generalize the problem to the quantum domain and show that a fair two-party zero-sum game can be carried out if the other player is permitted to adopt quantum measurement strategy.
We propose a numerical algorithm for finding optimal measurements for quantum-state discrimination. The theory of the semidefinite programming provides a simple check of the optimality of the numerically obtained results.
This article in Urdu presents an introduction to extension of an established branch of mathematics called game theory towards the quantum domain. We describe concepts of quantum games and evolutionary stability and go through some of the unanswered questions in this research area.
We use local adiabatic evolution to experimentally create and determine the ground state spin ordering of a fully-connected Ising model with up to 14 spins. Local adiabatic evolution -- in which the system evolution rate is a function of the instantaneous energy gap -- is found to maximize the ground state probability compared with other adiabatic methods while only requiring knowledge of the lowest $\sim N$ of the $2^N$ Hamiltonian eigenvalues. We also demonstrate that the ground state ordering can be experimentally identified as the most probable of all possible spin configurations, even whe…
Quantum theory is known to be nonlocal in the sense that separated parties can perform measurements on a shared quantum state to obtain correlated probability distributions, which cannot be achieved if the parties share only classical randomness. Here we find that the set of distributions compatible with sharing quantum states subject to some sufficiently restricted dimension is neither convex nor a superset of the classical distributions. We examine the relationship between quantum distributions associated with a dimensional constraint and classical distributions associated with limited share…
Recently, the resource theory of asymmetric distinguishability for quantum strategies was introduced by [Wang et al., Phys. Rev. Research 1, 033169 (2019)]. The fundamental objects in the resource theory are pairs of quantum strategies, which are generalizations of quantum channels that provide a framework to describe an arbitrary quantum interaction. In the present paper, we provide semi-definite program characterizations of the one-shot operational quantities in this resource theory. We then apply these semi-definite programs to study the advantage conferred by adaptive strategies in discrim…
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely related to the traditional Matching Pennies game. While not every two-person zero-sum finite game has an equilibrium in the set of pure strategies, von Neumann showed that there is always an equilibrium at which each player follows a mixed strategy. A mixed strategy deviating from the equilibrium strategy cannot increase a player's expected payoff. We show, how…
We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time, we find that when Nash equilibrium exists the pay off function is usually different from that in the classical counterpart except in some special cases. This presents an explicit example where quantum game and classical game may differ. When designing a quantum game with limited strategies, the allowed strategy should be carefully chosen according to the type of initial s…
An elementary derivation of best eavesdropping strategies for the 4 state BB84 quantum cryptography protocol is presented, for both incoherent and two--qubit coherent attacks. While coherent attacks do not help Eve to obtain more information, they are more powerful to reveal the whole message sent by Alice. Our results are based on symmetric eavesdropping strategies, which we show to be sufficient to analyze these kind of problems.
One of the main quests in quantum metrology is to attain the ultimate precision limit with given resources, where the resources are not only of the number of queries, but more importantly of the allowed strategies. With the same number of queries, the restrictions on the strategies constrain the achievable precision. In this work, we establish a systematic framework to identify the ultimate precision limit of different families of strategies, including the parallel, the sequential, and the indefinite-causal-order strategies, and provide an efficient algorithm that determines an optimal strateg…
The use of classical multiple-pass approach for phase estimation which mimics the behavior of the N00N states, is compared with quantum techniques. It is shown that in the presence of losses its performance is significantly worse than the one of the optimal quantum strategy.
There are many ways to decompose the Hilbert space H of a composite quantum system into tensor product subspaces. Different subsystem decompositions generally imply different interaction Hamiltonians V, and therefore different expectation values for subsystem observables. This means that thE uniqueness of physical predictions is not guaranteed, despite the uniqueness of the total Hamiltonian H and the total Hilbert space. Here we use Clausius' version of the second law of thermodynamics (CSL) and standard identifications of thermodynamic quantities to identify possible subsystem decompositions…
We study optimal and nearly-optimal quantum strategies for non-local XOR games. First, we prove the following general result: for every non-local XOR game, there exists a set of relations with the properties: (1) a quantum strategy is optimal for the game if and only if it satisfies the relations, and (2) a quantum strategy is nearly optimal for the game if and only if it approximately satisfies the relations. Next, we focus attention on a specific infinite family of XOR games: the CHSH(n) games. This family generalizes the well-known CHSH game. We describe the general form of CHSH(n) optimal …
In the Eisert protocol for 2 X 2 quantum games [Phys. Rev. Lett. 83, 3077], a number of authors have investigated the features arising from making the strategic space a two-parameter subset of single qubit unitary operators. We argue that the new Nash equilibria and the classical-quantum transitions that occur are simply an artifact of the particular strategy space chosen. By choosing a different, but equally plausible, two-parameter strategic space we show that different Nash equilibria with different classical-quantum transitions can arise. We generalize the two-parameter strategies and also…
The discrimination of quantum processes, including quantum states, channels, and superchannels, is a fundamental topic in quantum information theory. It is often of interest to analyze the optimal performance that can be achieved when discrimination strategies are restricted to a given subset of all strategies allowed by quantum mechanics. In this paper, we present a general formulation of the task of finding the maximum success probability for discriminating quantum processes as a convex optimization problem whose Lagrange dual problem exhibits zero duality gap. The proposed formulation can b…
Quantum Strategies for Rendezvous and Domination Tasks on Graphs with Mobile Agents
International Centre for Theory of Quantum Technologies, University of Gdańsk（格但斯克大学量子技术理论国际中心）；Department of Physics, Stockholm University（斯德哥尔摩大学物理系）；Department of Algorithms and System Modeling, Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology（格但斯克理工大学电子、电信与信息学院算法与系统建模系）
We provide a simple example that illustrates the advantage of adaptive over non-adaptive strategies for quantum channel discrimination. In particular, we give a pair of entanglement-breaking channels that can be perfectly discriminated by means of an adaptive strategy that requires just two channel evaluations, but for which no non-adaptive strategy can give a perfect discrimination using any finite number of channel evaluations.
The explicit construction is presented of two-player game satisfying: (i) symmetry with respect to the permutation of the players; (ii) the existence of upper bound on total payoff following from Bell inequality; (iii) the existence of unfair equilibrium with total payoff saturating the above bound. The quantum counterpart of the game is considered which possesses only fair equilibria and strategies outperforming the classical ones.
The prospect of using quantum computers to solve combinatorial optimization problems via the quantum approximate optimization algorithm (QAOA) has attracted considerable interest in recent years. However, a key limitation associated with QAOA is the need to classically optimize over a set of quantum circuit parameters. This classical optimization can have significant associated costs and challenges. Here, we provide an expanded description of Lyapunov control-inspired strategies for quantum optimization, as presented in [Magann et al., Phys. Rev. Lett. 129, 250502 (2022)], that do not require …
We report a quantum interference and imaging experiment which quantitatively demonstrates that Einstein-Podolsky-Rosen (EPR) type entangled two-photon states exhibit both momentum-momentum and position-position correlations, stronger than any classical correlation. The measurements show indeed that the uncertainties in the sum of momenta and in the difference of positions of the entangled two-photon satisfy both EPR inequalities D(k1+k2)<min(D(k1),D(k2)) and D(x1-x2)<min(D(x1),D(x2)). These two inequalities, together, represent a non-classicality condition. Our measurements provide a direct wa…
We derive general discrimination of quantum states chosen from a certain set, given initial $M$ copies of each state, and obtain the matrix inequality, which describe the bound between the maximum probability of correctly determining and that of error. The former works are special cases of our results.
We propose a scheme for a quantum game based on performing an EPR type experiment and in which each player's spatial directional choices are considered as their strategies. A classical mixed-strategy game is recovered by restricting the players' choices to specific spatial trajectories. We show that for players' directional choices for which the Bell-CHSH inequality is violated, the players' payoffs in the quantum game have no mapping within the classical mixed-strategy game. The scheme provides a more direct link between classical and quantum games.
Restricted Monte Carlo wave function method and Lindblad equation for identifying entangling open-quantum-system dynamics
Institute for Photonic Quantum Systems (PhoQS), Paderborn University（光子量子系统研究所（PhoQS），帕德博恩大学）；Niels Bohr Institute, University of Copenhagen（尼尔斯·玻尔研究所，哥本哈根大学）
We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assignment that maximizes the number of satisfied clauses. The probability of obtaining this assignment at the end of the quantum evolution measures the success of the algorithm. Here we report three strategies which consistently increase the success probability for the hardest instances in our ensemble: decreasing the overall evolution time, initializing the system in excited states, and adding a random local Hamiltonian …
Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state model, and by using nonlocal correlation functions that quantify the fidelity of quantum gates performed between distant qubits, we demonstrate that it possesses a quantum (zero-temperature) phase transition between a disordered phase and an ordered "cluster phase" in which it is possible to perform a universal set of quantum gates.
When quantum programs are executed on noisy intermediate-scale quantum (NISQ) computers, they experience hardware noise; consequently, the program outputs are often erroneous. To mitigate the adverse effects of hardware noise, it is necessary to understand the effect of hardware noise on the program output and more fundamentally, understand the impact of hardware noise on specific regions within a quantum program. Identifying and optimizing regions that are more noise-sensitive is the key to expanding the capabilities of NISQ computers. Toward achieving that goal, we propose CHARTER, a novel t…
The Prisoners' Dilemma is perhaps the most famous model in the field of game theory. Consequently, it is natural to investigate its quantum version when one considers to apply quantum strategies to game theory. There are two main results in this paper: 1) The well-known Prisoners' Dilemma can be categorized into three types and only the third type is adaptable for quantum strategies. 2) As a reverse problem of game theory, mechanism design provides a better circumstance for quantum strategies than game theory does.
We consider passive imaging tasks involving discrimination between known candidate objects and investigate the best possible accuracy with which the correct object can be identified. We analytically compute quantum-limited error bounds for hypothesis tests on any database of incoherent, quasi-monochromatic objects when the imaging system is dominated by optical diffraction. We further show that object-independent linear-optical spatial processing of the collected light exactly achieves these ultimate error rates, exhibiting superior scaling than spatially-resolved direct imaging as the scene b…
We use the quantum Fisher information (QFI) to diagnose a dynamical phase transition (DPT) in a closed quantum system, which is usually defined in terms of non-analytic behaviour of a time-averaged order parameter. Employing the Lipkin-Meshkov-Glick model as an illustrative example, we find that the DPT correlates with a peak in the QFI that can be explained by a generic connection to an underlying excited-state quantum phase transition that also enables us to also relate the scaling of the QFI with the behaviour of the order parameter. Motivated by the QFI as a quantifier of metrologically us…
It has long been recognized as a difficult problem to determine whether the observed statistical correlation between two classical variables arise from causality or from common causes. Recent research has shown that in quantum theoretical framework, the mechanisms of entanglement and quantum coherence provide an advantage in tackling this problem. In some particular cases, quantum common causes and quantum causality can be effectively distinguished using observations only. However, these solutions do not apply to all cases. There still exist enormous cases in which quantum common causes and qu…
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper is devoted to the analysis of interference of quantum strategies in quantum market games.
