اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImproving application performance with biased distributions of quantum states
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the properties of a specific distribution of mixed quantum states of arbitrary dimension that can be biased towards a specific mean purity. In particular, we analyze mixtures of Haar-random pure states with Dirichlet-distributed coefficients. We analytically derive the concentration parameters required to match the mean purity of the Bures and Hilbert--Schmidt distributions in any dimension. Numerical simulations suggest that this value recovers the Hilbert--Schmidt distribution exactly, offering an alternative and intuitive physical interpretation for ensembles of Hilbert--Schmidt-distributed random quantum states. We then demonstrate how substituting these Dirichlet-weighted Haar mixtures in place of the Bures and Hilbert--Schmidt distributions results in measurable performance advantages in machine-learning-based quantum state tomography systems and Bayesian quantum state reconstruction. Finally, we experimentally characterize the distribution of quantum states generated by both a cloud-accessed IBM quantum computer and an in-house source of polarization-entangled photons. In each case, our method can more closely match the underlying distribution than either Bures or Hilbert--Schmidt distributed states for various experimental conditions.
قيم البحث
اقرأ أيضاً
Variational quantum algorithms are believed to be promising for solving computationally hard problems and are often comprised of repeated layers of quantum gates. An example thereof is the quantum approximate optimization algorithm (QAOA), an approac
h to solve combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) systems. Gaining computational power from QAOA critically relies on the mitigation of errors during the execution of the algorithm, which for coherence-limited operations is achievable by reducing the gate count. Here, we demonstrate an improvement of up to a factor of 3 in algorithmic performance as measured by the success probability, by implementing a continuous hardware-efficient gate set using superconducting quantum circuits. This gate set allows us to perform the phase separation step in QAOA with a single physical gate for each pair of qubits instead of decomposing it into two C$Z$-gates and single-qubit gates. With this reduced number of physical gates, which scales with the number of layers employed in the algorithm, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances mapped onto three and seven qubits, using up to a total of 399 operations and up to 9 layers. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
Successful implementation of a fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold $P_{a}$ exists for any quantum gate that is to
be used in such a computation. Specifically, the error probability $P_{e}$ for such a gate must fall below the accuracy threshold: $P_{e} < P_{a}$. Estimates of $P_{a}$ vary widely, though $P_{a}sim 10^{-4}$ has emerged as a challenging target for hardware designers. In this paper we present a theoretical framework based on neighboring optimal control that takes as input a good quantum gate and returns a new gate with better performance. We illustrate this approach by applying it to all gates in a universal set of quantum gates produced using non-adiabatic rapid passage that has appeared in the literature. Performance improvements are substantial, both for ideal and non-ideal controls. Under suitable conditions detailed below, all gate error probabilities fall well below the target threshold of $10^{-4}$.
We introduce a new functional to estimate the producibility of mixed quantum states. When applicable, this functional outperforms the quantum Fisher information, and can be operatively exploited to characterize quantum states and phases by multiparti
te entanglement. The rationale is that producibility is expressible in terms of one- and two-point correlation functions only. This is especially valuable whenever the experimental measurements and the numerical simulation of other estimators result to be difficult, if not out of reach. We trace the theoretical usability perimeter of the new estimator and provide simulational evidence of paradigmatic spin examples.
We implement a Quantum Autoencoder (QAE) as a quantum circuit capable of correcting Greenberger-Horne-Zeilinger (GHZ) states subject to various noisy quantum channels : the bit-flip channel and the more general quantum depolarizing channel. The QAE s
hows particularly interesting results, as it enables to perform an almost perfect reconstruction of noisy states, but can also, more surprisingly, act as a generative model to create noise-free GHZ states. Finally, we detail a useful application of QAEs : Quantum Secret Sharing (QSS). We analyze how noise corrupts QSS, causing it to fail, and show how the QAE allows the QSS protocol to succeed even in the presence of noise.
Obtaining precise estimates of quantum observables is a crucial step of variational quantum algorithms. We consider the problem of estimating expectation values of molecular Hamiltonians, obtained on states prepared on a quantum computer. We propose
a novel estimator for this task, which is locally optimised with knowledge of the Hamiltonian and a classical approximation to the underlying quantum state. Our estimator is based on the concept of classical shadows of a quantum state, and has the important property of not adding to the circuit depth for the state preparation. We test its performance numerically for molecular Hamiltonians of increasing size, finding a sizable reduction in variance with respect to current measurement protocols that do not increase circuit depths.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
