اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFermion Coherence Hamiltonians
88
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We have established that the most general form of Hamiltonian that preserves fermionic coherent states stable in time, is that of the nonstationary free fermionic oscillator. This is to be compared with the earlier result of boson coherence Hamiltonian, which is of the more general form of the nonstationary forced bosonic oscillator. If however one admits Grassmann variables as Hamiltonian parameters then the coherence Hamiltonian takes again the form of (Grassmannian fermionic) forced oscillator.
قيم البحث
اقرأ أيضاً
In the field of quantum control, effective Hamiltonian engineering is a powerful tool that utilises perturbation theory to mitigate or enhance the effect that a variation in the Hamiltonian has on the evolution of the system. Here, we provide a gener
al framework for computing arbitrary time-dependent perturbation theory terms, as well as their gradients with respect to control variations, enabling the use of gradient methods for optimizing these terms. In particular, we show that effective Hamiltonian engineering is an instance of a bilinear control problem - the same general problem class as that of standard unitary design - and hence the same optimization algorithms apply. We demonstrate this method in various examples, including decoupling, recoupling, and robustness to control errors and stochastic errors. We also present a control engineering example that was used in experiment, demonstrating the practical feasibility of this approach.
The definition of accessible coherence is proposed. Through local measurement on the other subsystem and one way classical communication, a subsystem can access more coherence than the coherence of its density matrix. Based on the local accessible co
herence, the part that can not be locally accessed is also studied, which we call it remaining coherence. We study how the bipartite coherence is distributed by partition for both l1 norm coherence and relative entropy coherence, and the expressions for local accessible coherence and remaining coherence are derived. we also study some examples to illustrate the distribution.
Quantum coherence, like entanglement, is a fundamental resource in quantum information. In recent years, remarkable progress has been made in formulating resource theory of coherence from a broader perspective. The notions of block-coherence and POVM
-based coherence have been established. Certain challenges, however, remain to be addressed. It is difficult to define incoherent operations directly, without requiring incoherent states, which proves a major obstacle in establishing the resource theory of dynamical coherence. In this paper, we overcome this limitation by introducing an alternate definition of incoherent operations, induced via coherence measures, and quantify dynamical coherence based on this definition. Finally, we apply our proposed definition to quantify POVM-based dynamical coherence.
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the Hamiltonian involve
d must have local structure, which leads to a result about eigenvalue gaps from information theory. I also improve results about simulating quantum circuits with AQC. Second, I look at classically simulating time evolution with local Hamiltonians and finding their ground state properties. I give a numerical method for finding the ground state of translationally invariant Hamiltonians on an infinite tree. This method is based on imaginary time evolution within the Matrix Product State ansatz, and uses a new method for bringing the state back to the ansatz after each imaginary time step. I then use it to investigate the phase transition in the transverse field Ising model on the Bethe lattice. Third, I focus on locally constrained quantum problems Local Hamiltonian and Quantum Satisfiability and prove several new results about their complexity. Finally, I define a Hamiltonian Quantum Cellular Automaton, a continuous-time model of computation which doesnt require control during the computation process, only preparation of product initial states. I construct two of these, showing that time evolution with a simple, local, translationally invariant and time-independent Hamiltonian can be used to simulate quantum circuits.
Iterative phase estimation has long been used in quantum computing to estimate Hamiltonian eigenvalues. This is done by applying many repetitions of the same fundamental simulation circuit to an initial state, and using statistical inference to glean
estimates of the eigenvalues from the resulting data. Here, we show a generalization of this framework where each of the steps in the simulation uses a different Hamiltonian. This allows the precision of the Hamiltonian to be changed as the phase estimation precision increases. Additionally, through the use of importance sampling, we can exploit knowledge about the ground state to decide how frequently each Hamiltonian term should appear in the evolution, and minimize the variance of our estimate. We rigorously show, if the Hamiltonian is gapped and the sample variance in the ground state expectation values of the Hamiltonian terms sufficiently small, that this process has a negligible impact on the resultant estimate and the success probability for phase estimation. We demonstrate this process numerically for two chemical Hamiltonians, and observe substantial reductions in the number of terms in the Hamiltonian; in one case, we even observe a reduction in the number of qubits needed for the simulation. Our results are agnostic to the particular simulation algorithm, and we expect these methods to be applicable to a range of approaches.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
