اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum circuits computing unitary transformations
80
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $H_1, H_2$ be Hilbert spaces of the same finite dimension $ge2$, and $C$ an arbitrary quantum circuit with (principal) input state in $H_1$ and (principal) output state in $H_2$. $C$ may use ancillas and produce garbage which is traced out. $C$ may employ classical channels and measurement gates. If $C$ computes, for each computation path $mu$ through the circuit, a unitary transformation $U_mu: H_1 to H_2$ then, for each $mu$, the probability that a computation takes path $mu$ is independent of the input.
قيم البحث
اقرأ أيضاً
There are major advantages in a newer version of Grovers quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject search. We
show the techniques to achieve the reduction of the problem to one on an invariant subspace of dimension just equal to two.
Variational quantum circuits are promising tools whose efficacy depends on their optimisation method. For noise-free unitary circuits, the quantum generalisation of natural gradient descent was recently introduced. The method can be shown to be equiv
alent to imaginary time evolution, and is highly effective due to a metric tensor reconciling the classical parameter space to the devices Hilbert space. Here we generalise quantum natural gradient to consider arbitrary quantum states (both mixed and pure) via completely positive maps; thus our circuits can incorporate both imperfect unitary gates and fundamentally non-unitary operations such as measurements. Whereas the unitary variant relates to classical Fisher information, here we find that quantum Fisher information defines the core metric in the space of density operators. Numerical simulations indicate that our approach can outperform other variational techniques when circuit noise is present. We finally assess the practical feasibility of our implementation and argue that its scalability is only limited by the number and quality of imperfect gates and not by the number of qubits.
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum resource, whil
e the iteration of sequential measurements and local rotations encodes the quantum algorithm. Up to now, technical constraints have limited a scalable approach to this quantum computing alternative. The initial cluster state can be generated with available controlled-phase gates, while the quantum algorithm makes use of high-fidelity readout and coherent feedforward. With current technology, we estimate that quantum algorithms with above 20 qubits may be implemented in the path towards quantum supremacy. Moreover, we propose an alternative initial state with properties of maximal persistence and maximal connectedness, reducing the required resources of one-way quantum computing protocols.
We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an efficient way, e
nding in a tidy arrangement of SU(2) transformations. The method hinges only on a linear relationship between input and output states, and can thus be applied to a variety of scenarios, such as microwaves, acoustics, and quantum fields.
We show that a set of optical memories can act as a configurable linear optical network operating on frequency-multiplexed optical states. Our protocol is applicable to any quantum memories that employ off-resonant Raman transitions to store optical
information in atomic spins. In addition to the configurability, the protocol also offers favourable scaling with an increasing number of modes where N memories can be configured to implement an arbitrary N-mode unitary operations during storage and readout. We demonstrate the versatility of this protocol by showing an example where cascaded memories are used to implement a conditional CZ gate.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
