Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum Correlation Bounds for Quantum Information Experiments Optimization: the Wigner Inequality Case
163
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Violation of modified Wigner inequality by means binary bipartite quantum system allows the discrimination between the quantum world and the classical local-realistic one, and also ensures the security of Ekert-like quantum key distribution protocol. In this paper we study both theoretically and experimentally the bounds of quantum correlation associated to the modified Wigners inequality finding the optimal experimental configuration for its maximal violation. We also extend this analysis to the implementation of Ekerts protocol.
rate research
Read More
While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a convex function over an $n$-dimensional convex body using $tilde{O}(n)$ queries to oracles that evaluate the objective function and determine membership in the convex body. This represents a quadratic improvement over the best-known classical algorithm. We also study limitations on the power of quantum computers for general convex optimization, showing that it requires $tilde{Omega}(sqrt n)$ evaluation queries and $Omega(sqrt{n})$ membership queries.
In this work, we consider an upper bound for the quantum mutual information in thermal states of a bipartite quantum system. This bound is related with the interaction energy and logarithm of the partition function of the system. We demonstrate the connection between this upper bound and the value of the mutual information for the bipartite system realized by two spin-1/2 particles in the external magnetic field with the XY-Heisenberg interaction.
With progress in quantum technology more sophisticated quantum annealing devices are becoming available. While they offer new possibilities for solving optimization problems, their true potential is still an open question. As the optimal design of adiabatic algorithms plays an important role in their assessment, we illustrate the aspects and challenges to consider when implementing optimization problems on quantum annealing hardware based on the example of the traveling salesman problem (TSP). We demonstrate that tunneling between local minima can be exponentially suppressed if the quantum dynamics are not carefully tailored to the problem. Furthermore we show that inequality constraints, in particular, present a major hurdle for the implementation on analog quantum annealers. We finally argue that programmable digital quantum annealers can overcome many of these obstacles and can - once large enough quantum computers exist - provide an interesting route to using quantum annealing on a large class of problems.
We study the performance of classical and quantum machine learning (ML) models in predicting outcomes of physical experiments. The experiments depend on an input parameter $x$ and involve execution of a (possibly unknown) quantum process $mathcal{E}$. Our figure of merit is the number of runs of $mathcal{E}$ required to achieve a desired prediction performance. We consider classical ML models that perform a measurement and record the classical outcome after each run of $mathcal{E}$, and quantum ML models that can access $mathcal{E}$ coherently to acquire quantum data; the classical or quantum data is then used to predict outcomes of future experiments. We prove that for any input distribution $mathcal{D}(x)$, a classical ML model can provide accurate predictions on average by accessing $mathcal{E}$ a number of times comparable to the optimal quantum ML model. In contrast, for achieving accurate prediction on all inputs, we prove that exponential quantum advantage is possible. For example, to predict expectations of all Pauli observables in an $n$-qubit system $rho$, classical ML models require $2^{Omega(n)}$ copies of $rho$, but we present a quantum ML model using only $mathcal{O}(n)$ copies. Our results clarify where quantum advantage is possible and highlight the potential for classical ML models to address challenging quantum problems in physics and chemistry.
The interplay between electron interaction and geometry in a molecular system can lead to rather paradoxical situations. The prime example is the dissociation limit of the hydrogen molecule: While a significant increase of the distance $r$ between the two nuclei marginalizes the electron-electron interaction, the exact ground state does, however, not take the form of a single Slater determinant. By first reviewing and then employing concepts from quantum information theory, we resolve this paradox and its generalizations to more complex systems in a quantitative way. To be more specific, we illustrate and prove that thermal noise due to finite, possibly even just infinitesimally low, temperature $T$ will destroy the entanglement beyond a critical separation distance $r_{mathrm{crit}}$($T$) entirely. Our analysis is comprehensive in the sense that we simultaneously discuss both total correlation and entanglement in the particle picture as well as in the orbital/mode picture. Our results reveal a conceptually new characterization of static and dynamical correlation in ground states by relating them to the (non)robustness of correlation with respect to thermal noise.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
