One qubit as a universal approximant
نویسندگان
چکیده
A single-qubit circuit can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. The approximant presented this work is operated through a series gates that take as their parameterization independent variable target and an additional set adjustable parameters. re-uploaded every gate while parameters are optimized for each function. output state becomes more accurate number re-uploadings increases, i. e., layers parameterized with applied. In work, we provide two different proofs claim related to both Fourier Universal Approximation Theorem Neural Networks, benchmark methods against classical counterparts. We further implement real superconducting qubit device, demonstrating how ability describe functions improves depth circuit. This shows robustness re-uploading technique on Quantum Machine Learning.
منابع مشابه
Universal Manipulation of a Single Qubit
We find the optimal universal way of manipulating a single qubit, |ψ(θ, φ)〉, such that (θ, φ) → (θ− k, φ− l). Such optimal transformations fall into two classes. For 0 ≤ k ≤ π/2 the optimal map is the identity and the fidelity varies monotonically from 1 (for k = 0) to 1/2 (for k = π/2). For π/2 ≤ k ≤ π the optimal map is the universal-NOT gate and the fidelity varies monotonically from 1/2 (fo...
متن کاملCharacterization of universal two-qubit Hamiltonians
Suppose we can apply a given 2-qubit Hamiltonian H to any (ordered) pair of qubits. We say H is n-universal if it can be used to approximate any unitary operation on n qubits. While it is well known that almost any 2-qubit Hamiltonian is 2-universal (Deutsch, Barenco, Ekert 1995; Lloyd 1995), an explicit characterization of the set of non-universal 2-qubit Hamiltonians has been elusive. Our mai...
متن کاملExact two-qubit universal quantum circuit.
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the ap...
متن کاملCharacterization of non-universal two-qubit Hamiltonians
It is known that almost all 2-qubit gates are universal for quantum computing (Lloyd 1995; Deutsch, Barenco, Eckert 1995). However, an explicit characterization of non-universal 2-qubit gates is not known. We consider a closely related problem of characterizing the set of non-universal 2-qubit Hamiltonians. We call a 2-qubit Hamiltonian n-universal if, when applied on different pairs of qubits,...
متن کاملMinimal Universal Two-Qubit CNOT-based Circuits
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, best...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2021
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.104.012405