Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userUniversal Simulation of Hamiltonians Using a Finite Set of Control Operations
84
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Any quantum system with a non-trivial Hamiltonian is able to simulate any other Hamiltonian evolution provided that a sufficiently large group of unitary control operations is available. We show that there exist finite groups with this property and present a sufficient condition in terms of group characters. We give examples of such groups in dimension 2 and 3. Furthermore, we show that it is possible to simulate an arbitrary bipartite interaction by a given one using such groups acting locally on the subsystems.
rate research
Read More
The ability to simulate one Hamiltonian with another is an important primitive in quantum information processing. In this paper, a simulation method for arbitrary $sigma_z otimes sigma_z$ interaction based on Hadamard matrices (quant-ph/9904100) is generalized for any pairwise interaction. We describe two applications of the generalized framework. First, we obtain a class of protocols for selecting an arbitrary interaction term in an n-qubit Hamiltonian. This class includes the scheme given in quant-ph/0106064v2. Second, we obtain a class of protocols for inverting an arbitrary, possibly unknown n-qubit Hamiltonian, generalizing the result in quant-ph/0106085v1.
We present a systematic scheme for optimization of quantum simulations. Specifically, we show how polychromatic driving can be used to significantly improve the driving of Raman transitions in the Lambda system, which opens new possibilities for controlled driven-induced effective dynamics.
Stoquastic Hamiltonians are characterized by the property that their off-diagonal matrix elements in the standard product basis are real and non-positive. Many interesting quantum models fall into this class including the Transverse field Ising Model (TIM), the Heisenberg model on bipartite graphs, and the bosonic Hubbard model. Here we consider the problem of estimating the ground state energy of a local stoquastic Hamiltonian $H$ with a promise that the ground state of $H$ has a non-negligible correlation with some `guiding state that admits a concise classical description. A formalized version of this problem called Guided Stoquastic Hamiltonian is shown to be complete for the complexity class MA (a probabilistic analogue of NP). To prove this result we employ the Projection Monte Carlo algorithm with a variable number of walkers. Secondly, we show that the ground state and thermal equilibrium properties of the ferromagnetic TIM can be simulated in polynomial time on a classical probabilistic computer. This result is based on the approximation algorithm for the classical ferromagnetic Ising model due to Jerrrum and Sinclair (1993).
Recently, a generalization of the standard optical multiport was proposed [Phys. Rev. A 93, 043845 (2016)]. These directionally unbiased multiports allow photons to reverse direction and exit backwards from the input port, providing a realistic linear optical scattering vertex for quantum walks on arbitrary graph structures. Here, it is shown that arrays of these multiports allow the simulation of a range of discrete-time Hamiltonian systems. Examples are described, including a case where both spatial and internal degrees of freedom are simulated. Because input ports also double as output ports, there is substantial savings of resources compared to feed-forward networks carrying out the same functions. The simulation is implemented in a scalable manner using only linear optics, and can be generalized to higher dimensional systems in a straightforward fashion, thus offering a concrete experimentally achievable implementation of graphical models of discrete-time quantum systems.
We show that it is possible to construct closed quantum systems governed by a bilinear Hamiltonian depending on an arbitrary input signal. This is achieved by coupling the system to a quantum input field and performing a feedback of the output field back into the system to cancel out the stochastic effects, with the signal being added to the field between these events and later subtracted. Here we assume the zero time delay limit between the various connections and operations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
