اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImproving Hamiltonian encodings with the Gray code
91
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Due to the limitations of present-day quantum hardware, it is especially critical to design algorithms that make the best possible use of available resources. When simulating quantum many-body systems on a quantum computer, straightforward encodings that transform many-body Hamiltonians into qubit Hamiltonians use $N$ of the available basis states of an $N$-qubit system, whereas $2^N$ are in theory available. We explore an efficient encoding that uses the entire set of basis states, where terms in the Hamiltonian are mapped to qubit operators with a Hamiltonian that acts on the basis states in Gray code order. This encoding is applied to the commonly-studied problem of finding the ground state energy of a deuteron with a simulated variational quantum eigensolver (VQE). It is compared to a standard one-hot encoding, and various trade-offs that arise are analyzed. The energy distribution of VQE solutions has smaller variance than the one obtained by the one-hot encoding even in the presence of simulated hardware noise, despite an increase in the number of measurements. The reduced number of qubits and a shorter-depth variational ansatz enables the encoding of larger problems on current-generation machines. This encoding also demonstrates improvements for simulating time evolution of the same system, producing circuits for the evolution operators with reduced depth and roughly half the number of gates compared to a one-hot encoding.
قيم البحث
اقرأ أيضاً
We reformulate the continuous space Schrodinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. Binary encoding of position
produces a Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code, and a Hamming distance 2 Gray code yields the additional effect of reducing the spin model down to the XZ and transverse Ising model respectively. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of $k$-local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wavefunction to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect to lattice discretization for all encodings. For the Hamming distance 2 Gray code, the evolution starts with the transverse Hamiltonian before introducing penalties such that the low lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.
In this paper, our aim is to propose a model for code abstraction, based on abstract interpretation, allowing us to improve the precision of a recently proposed static analysis by abstract interpretation of dynamic languages. The problem we tackle he
re is that the analysis may add some spurious code to the string-to-execute abstract value and this code may need some abstract representations in order to make it analyzable. This is precisely what we propose here, where we drive the code abstraction by the analysis we have to perform.
Simulation of fermionic many-body systems on a quantum computer requires a suitable encoding of fermionic degrees of freedom into qubits. Here we revisit the Superfast Encoding introduced by Kitaev and one of the authors. This encoding maps a target
fermionic Hamiltonian with two-body interactions on a graph of degree $d$ to a qubit simulator Hamiltonian composed of Pauli operators of weight $O(d)$. A system of $m$ fermi modes gets mapped to $n=O(md)$ qubits. We propose Generalized Superfast Encodings (GSE) which require the same number of qubits as the original one but have more favorable properties. First, we describe a GSE such that the corresponding quantum code corrects any single-qubit error provided that the interaction graph has degree $dge 6$. In contrast, we prove that the original Superfast Encoding lacks the error correction property for $dle 6$. Secondly, we describe a GSE that reduces the Pauli weight of the simulator Hamiltonian from $O(d)$ to $O(log{d})$. The robustness against errors and a simplified structure of the simulator Hamiltonian offered by GSEs can make simulation of fermionic systems within the reach of near-term quantum devices. As an example, we apply the new encoding to the fermionic Hubbard model on a 2D lattice.
The time-frequency degree of freedom is a powerful resource for implementing high-dimensional quantum information processing. In particular, field-orthogonal pulsed temporal modes offer a flexible framework compatible with both long-distance fibre ne
tworks and integrated waveguide devices. In order for this architecture to be fully utilised, techniques to reliably generate diverse quantum states of light and accurately measure complex temporal waveforms must be developed. To this end, nonlinear processes mediated by spectrally shaped pump pulses in group-velocity engineered waveguides and crystals provide a capable toolbox. In this review, we examine how tailoring the phasematching conditions of parametric downconversion and sum-frequency generation allows for highly pure single-photon generation, flexible temporal-mode entanglement, and accurate measurement of time-frequency photon states. We provide an overview of experimental progress towards these goals, and summarise challenges that remain in the field.
A Wilsonian approach to $pipi$ scattering based in the Glazek-Wilson Similarity Renormalization Group (SRG) for Hamiltonians is analyzed in momentum space up to a maximal CM energy of $sqrt{s}=1.4$ GeV. To this end, we identify the corresponding rela
tivistic Hamiltonian by means of the 3D reduction of the Bethe-Salpeter equation in the Kadyshevsky scheme, introduce a momentum grid and provide an isospectral definition of the phase-shift based on a spectral shift of a Chebyshev angle. We also propose a new method to integrate the SRG equations based on the Crank-Nicolson algorithm with a single step finite difference so that isospectrality is preserved at any step of the calculations. We discuss issues on the unnatural high momentum tails present in the fitted interactions and reaching far beyond the maximal CM energy of $sqrt{s}=1.4$ GeV and how these tails can be integrated out explicitly by using Block-Diagonal generators of the SRG.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
