Preparation of quantum superposition using partial negation
- URL: http://arxiv.org/abs/2109.14369v1
- Date: Wed, 29 Sep 2021 11:57:44 GMT
- Title: Preparation of quantum superposition using partial negation
- Authors: Sara Anwer, Ahmed Younes, Islam Elkabani, Ashraf Elsayed
- Abstract summary: The speed of the preparation process and the accuracy of the prepared superposition has a special importance to the success of any quantum algorithm.
The proposed method can be used to prepare the required quantum superposition in $mathcalO(n)$ steps.
- Score: 1.911678487931003
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: The preparation of a quantum superposition is the key to the success of many
quantum algorithms and quantum machine learning techniques. The preparation of
an incomplete or a non-uniform quantum superposition with certain properties is
a non-trivial task. In this paper, an $n$-qubits variational quantum circuit
using partial negation and controlled partial negation operators will be
proposed to prepare an arbitrary quantum superposition. The proposed quantum
circuit follows the symmetries of the unitary Lie group. The speed of the
preparation process and the accuracy of the prepared superposition has a
special importance to the success of any quantum algorithm. The proposed method
can be used to prepare the required quantum superposition in $\mathcal{O}(n)$
steps and with high accuracy when compared with relevant methods in literature.
Related papers
- The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Quantum Phase Processing and its Applications in Estimating Phase and
Entropies [10.8525801756287]
"quantum phase processing" can directly apply arbitrary trigonometric transformations to eigenphases of a unitary operator.
Quantum phase processing can extract the eigen-information of quantum systems by simply measuring the ancilla qubit.
We propose a new quantum phase estimation algorithm without quantum Fourier transform, which requires the fewest ancilla qubits and matches the best performance so far.
arXiv Detail & Related papers (2022-09-28T17:41:19Z) - An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers.
This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
arXiv Detail & Related papers (2022-05-11T12:10:52Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Variational quantum process tomography [12.843681115589122]
We put forward a quantum machine learning algorithm which encodes the unknown unitary quantum process into a relatively shallow depth parametric quantum circuit.
Results show that those quantum processes could be reconstructed with high fidelity, while the number of input states required are at least $2$ orders of magnitude less than required by the standard quantum process tomography.
arXiv Detail & Related papers (2021-08-05T03:36:26Z) - Natural parameterized quantum circuit [0.0]
We introduce the natural parameterized quantum circuit (NPQC) that can be initialised with a Euclidean quantum geometry.
For a general class of quantum circuits, the NPQC has the minimal quantum Cram'er-Rao bound.
Our results can be used to enhance currently available quantum processors.
arXiv Detail & Related papers (2021-07-29T14:54:04Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - On quantum ensembles of quantum classifiers [0.0]
Quantum machine learning seeks to exploit the underlying nature of a quantum computer to enhance machine learning techniques.
A specific implementation of the quantum ensemble of quantum classifiers, called the accuracy-weighted quantum ensemble, can be fully dequantised.
On the other hand, the general quantum ensemble framework is shown to contain the well-known Deutsch-Jozsa algorithm that notably provides a quantum speedup.
arXiv Detail & Related papers (2020-01-29T13:46:16Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.