Do you want to publish a course? Click here

Advancing Hybrid Quantum-Classical Algorithms via Mean-Operators

224   0   0.0 ( 0 )
 Added by Donggyu Kim
 Publication date 2021
  fields Physics
and research's language is English




Ask ChatGPT about the research

Entanglement in quantum many-body systems is the key concept for future technology and science, opening up a possibility to explore uncharted realms in an enormously large Hilbert space. The hybrid quantum-classical algorithms have been suggested to control quantum entanglement of many-body systems, and yet their applicability is intrinsically limited by the numbers of qubits and quantum operations. Here we propose a theory which overcomes the limitations by combining advantages of the hybrid algorithms and the standard mean-field-theory in condensed matter physics, named as mean-operator-theory. We demonstrate that the number of quantum operations to prepare an entangled target many-body state such as symmetry-protected-topological states is significantly reduced by introducing a mean-operator. We also show that a class of mean-operators is expressed as time-evolution operators and our theory is directly applicable to quantum simulations with $^{87}$Rb neutral atoms or trapped $^{40}$Ca$^+$ ions.



rate research

Read More

We consider the task of estimating the expectation value of an $n$-qubit tensor product observable $O_1otimes O_2otimes cdots otimes O_n$ in the output state of a shallow quantum circuit. This task is a cornerstone of variational quantum algorithms for optimization, machine learning, and the simulation of quantum many-body systems. Here we study its computational complexity for constant-depth quantum circuits and three types of single-qubit observables $O_j$ which are (a) close to the identity, (b) positive semidefinite, (c) arbitrary. It is shown that the mean value problem admits a classical approximation algorithm with runtime scaling as $mathrm{poly}(n)$ and $2^{tilde{O}(sqrt{n})}$ in cases (a,b) respectively. In case (c) we give a linear-time algorithm for geometrically local circuits on a two-dimensional grid. The mean value is approximated with a small relative error in case (a), while in cases (b,c) we satisfy a less demanding additive error bound. The algorithms are based on (respectively) Barvinoks polynomial interpolation method, a polynomial approximation for the OR function arising from quantum query complexity, and a Monte Carlo method combined with Matrix Product State techniques. We also prove a technical lemma characterizing a zero-free region for certain polynomials associated with a quantum circuit, which may be of independent interest.
Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as the quantum variational eigensolver was developed with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through relaxation of exponential splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.
Quantum computers can exploit a Hilbert space whose dimension increases exponentially with the number of qubits. In experiment, quantum supremacy has recently been achieved by the Google team by using a noisy intermediate-scale quantum (NISQ) device with over 50 qubits. However, the question of what can be implemented on NISQ devices is still not fully explored, and discovering useful tasks for such devices is a topic of considerable interest. Hybrid quantum-classical algorithms are regarded as well-suited for execution on NISQ devices by combining quantum computers with classical computers, and are expected to be the first useful applications for quantum computing. Meanwhile, mitigation of errors on quantum processors is also crucial to obtain reliable results. In this article, we review the basic results for hybrid quantum-classical algorithms and quantum error mitigation techniques. Since quantum computing with NISQ devices is an actively developing field, we expect this review to be a useful basis for future studies.
Blockchain technology is facing critical issues of scalability, efficiency and sustainability. These problems are necessary to solve if blockchain is to become a technology that can be used responsibly. Useful quantum computers could potentially be developed by the time that blockchain will be widely implemented for mission-critical work at financial and other institutions. Quantum computing will not only cause challenges for blockchain, but can also be harnessed to better implement parts of blockchain technologies including cryptocurrencies. We review the work that has been done in the area of quantum blockchain and hybrid quantum-classical blockchain technology and discuss open questions that remain.
We present direct local-probe evidence for strongly hybridized nuclear-electronic spin states of an Ising ferromagnet LiHoF$_4$ in a transverse magnetic field. The nuclear-electronic states are addressed via a magnetic resonance in the GHz frequency range using coplanar resonators and a vector network analyzer. The magnetic resonance spectrum is successfully traced over the entire field-temperature phase diagram, which is remarkably well reproduced by mean-field calculations. Our method can be directly applied to a broad class of materials containing rare-earth ions for probing the substantially mixed nature of the nuclear and electronic moments.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا