Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAll pure fermionic non-Gaussian states are magic states for matchgate computations
87
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Magic states were introduced in the context of Clifford circuits as a resource that elevates classically simulatable computations to quantum universal capability, while maintaining the same gate set. Here we study magic states in the context of matchgate (MG) circuits, where the notion becomes more subtle, as MGs are subject to locality constraints and also the SWAP gate is not available. Nevertheless a similar picture of gate-gadget constructions applies, and we show that every pure fermionic state which is non-Gaussian, i.e. which cannot be generated by MGs from a computational basis state, is a magic state for MG computations. This result has significance for prospective quantum computing implementation in view of the fact that MG circuit evolutions coincide with the quantum physical evolution of non-interacting fermions.
rate research
Read More
We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semi-local Gaussian unitary operations, as well as local quadrature measurements. We then use this graphical calculus to analyze continuous-variable (CV) cluster states, the essential resource for one-way quantum computing with CV systems. Current graphical approaches to CV cluster states are only valid in the unphysical limit of infinite squeezing, and the associated graph transformation rules only apply when the initial and final states are of this form. Our formalism applies to all Gaussian pure states and subsumes these rules in a natural way. In addition, the term CV graph state currently has several inequivalent definitions in use. Using this formalism we provide a single unifying definition that encompasses all of them. We provide many examples of how the formalism may be used in the context of CV cluster states: defining the closest CV cluster state to a given Gaussian pure state and quantifying the error in the approximation due to finite squeezing; analyzing the optimality of certain methods of generating CV cluster states; drawing connections between this new graphical formalism and bosonic Hamiltonians with Gaussian ground states, including those useful for CV one-way quantum computing; and deriving a graphical measure of bipartite entanglement for certain classes of CV cluster states. We mention other possible applications of this formalism and conclude with a brief note on fault tolerance in CV one-way quantum computing.
We show that a proper expression of the uncertainty relation for a pair of canonically-conjugate continuous variables relies on entropy power, a standard notion in Shannon information theory for real-valued signals. The resulting entropy-power uncertainty relation is equivalent to the entropic formulation of the uncertainty relation due to Bialynicki-Birula and Mycielski, but can be further extended to rotated variables. Hence, based on a reasonable assumption, we give a partial proof of a tighter form of the entropy-power uncertainty relation taking correlations into account and provide extensive numerical evidence of its validity. Interestingly, it implies the generalized (rotation-invariant) Schrodinger-Robertson uncertainty relation exactly as the original entropy-power uncertainty relation implies Heisenberg relation. It is saturated for all Gaussian pure states, in contrast with hitherto known entropic formulations of the uncertainty principle.
In this article we derive a closed form expression for the symmetric logarithmic derivative of Fermionic Gaussian states. This provides a direct way of computing the quantum Fisher Information for Fermionic Gaussian states. Applications ranges from quantum Metrology with thermal states and non-equilibrium steady states with Fermionic many-body systems.
Understanding the relation between the different forms of inseparability in quantum mechanics is a longstanding problem in the foundations of quantum theory and has implications for quantum information processing. Here we make progress in this direction by establishing a direct link between quantum teleportation and Bell nonlocality. In particular, we show that all entangled states which are useful for teleportation are nonlocal resources, i.e. lead to deterministic violation of Bells inequality. Our result exploits the phenomenon of super-activation of quantum nonlocality, recently proved by Palazuelos, and suggests that the latter might in fact be generic.
We show that genuine multipartite entanglement of all multipartite pure states in arbitrary finite dimension can be detected in a device-independent way by employing bipartite Bell inequalities on states that are deterministically generated from the initial state via local operations. This leads to an efficient scheme for large classes of multipartite states that are relevant in quantum computation or condensed-matter physics, including cluster states and the ground state of the Affleck-Kennedy-Lieb-Tasaki (AKLT) model. For cluster states the detection of genuine multipartite entanglement involves only measurements on a constant number of systems with an overhead that scales linear with the system size, while for the AKLT model the overhead is polynomial. In all cases our approach shows robustness against experimental imperfections.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
