Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum Hypercube States
393
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We introduce quantum hypercube states, a class of continuous-variable quantum states that are generated as orthographic projections of hypercubes onto the quadrature phase-space of a bosonic mode. In addition to their interesting geometry, hypercube states display phase-space features much smaller than Plancks constant, and a large volume of Wigner-negativity. We theoretically show that these features make hypercube states sensitive to displacements at extremely small scales in a way that is surprisingly robust to initial thermal occupation and to small separation of the superposed state-components. In a high-temperature proof-of-principle optomechanics experiment we observe, and match to theory, the signature outer-edge vertex structure of hypercube states.
rate research
Read More
Adding self-loops at each vertex of a graph improves the performance of quantum walks algorithms over loopless algorithms. Many works approach quantum walks to search for a single marked vertex. In this article, we experimentally address several problems related to quantum walk in the hypercube with self-loops to search for multiple marked vertices. We first investigate the quantum walk in the loopless hypercube. We saw that neighbor vertices are also amplified and that approximately $1/2$ of the system energy is concentrated in them. We show that the optimal value of $l$ for a single marked vertex is not optimal for multiple marked vertices. We define a new value of $l = (n/N)cdot k$ to search multiple marked vertices. Next, we use this new value of $l$ found to analyze the search for multiple marked vertices non-adjacent and show that the probability of success is close to $1$. We also use the new value of $l$ found to analyze the search for several marked vertices that are adjacent and show that the probability of success is directly proportional to the density of marked vertices in the neighborhood. We also show that, in the case where neighbors are marked, if there is at least one non-adjacent marked vertex, the probability of success increases to close to $1$. The results found show that the self-loop value for the quantum walk in the hypercube to search for several marked vertices is $l = (n / N) cdot k $.
The n-dimensional hypercube quantum random walk (QRW) is a particularily appealing example of a quantum walk because it has a natural implementation on a register on $n$ qubits. However, any real implementation will encounter decoherence effects due to interactions with uncontrollable degrees of freedom. We present a complete characterization of the mixing properties of the hypercube QRW under a physically relevant Markovian decoherence model. In the local decoherence model considered the non-unitary dynamics are modeled as a sum of projections on individual qubits to an arbitrary direction on the Bloch sphere. We prove that there is always classical (asymptotic) mixing in this model and specify the conditions under which instantaneous mixing textit{always} exists. And we show that the latter mixing property, as well as the classical mixing time, depend heavily on the exact environmental interaction and its strength. Therefore, algorithmic applications of the QRW on the hypercube, if they intend to employ mixing properties, need to consider both the walk dynamics and the precise decoherence model.
We show how continuous matrix product states of quantum field theories can be described in terms of the dissipative non-equilibrium dynamics of a lower-dimensional auxiliary boundary field theory. We demonstrate that the spatial correlation functions of the bulk field can be brought into one-to-one correspondence with the temporal statistics of the quantum jumps of the boundary field. This equivalence: (1) illustrates an intimate connection between the theory of continuous quantum measurement and quantum field theory; (2) gives an explicit construction of the boundary field theory allowing the extension of real-space renormalization group methods to arbitrary dimensional quantum field theories without the introduction of a lattice parameter; and (3) yields a novel interpretation of recent cavity QED experiments in terms of quantum field theory, and hence paves the way toward observing genuine quantum phase transitions in such zero-dimensional driven quantum systems.
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a generalised stabilizer formalism to describe this class of states. We introduce the notion of k-uniformity and show that this gives rise to classes of states which are inequivalent under the action of the local Pauli group. Finally we disclose a one-to-one correspondence with states employed in quantum algorithms, such as Deutsch-Jozsas and Grovers.
The statistical properties of photons are fundamental to investigating quantum mechanical phenomena using light. In multi-photon, two-mode systems, correlations may exist between outcomes of measurements made on each mode which exhibit useful properties. Correlation in this sense can be thought of as increasing the probability of a particular outcome of a measurement on one subsystem given a measurement on a correlated subsystem. Here, we show a statistical property we call discorrelation, in which the probability of a particular outcome of one subsystem is reduced to zero, given a measurement on a discorrelated subsystem. We show how such a state can be constructed using readily available building blocks of quantum optics, namely coherent states, single photons, beam splitters and projective measurement. We present a variety of discorrelated states, show that they are entangled, and study their sensitivity to loss.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
