arXiv subjects

Morteza Nikaeen

Publications and source records attributed to Morteza Nikaeen.

4 recordsLinked to original sources

arXiv2024

Development of Neural Network-Based Optimal Control Pulse Generator for Quantum Logic Gates Using the GRAPE Algorithm in NMR Quantum Computer

In this paper, we introduce a neural network to generate optimal control pulses for general single-qubit quantum logic gates, within a Nuclear Magnetic Resonance (NMR) quantum computer. By utilizing a neural network, we can efficiently implement any single-qubit quantum logic gates within a reasonable time scale. The network is trained by control pulses generated by the GRAPE algorithm, all starting from the same initial point. After implementing the network, we tested it using numerical simulations. Also, we present the results of applying Neural Network-generated pulses to a three-qubit benchtop NMR system and compare them with simulation outcomes. These numerical and experimental results showcase the precision of the Neural Network-generated pulses in executing the desired dynamics. Ultimately, by developing the neural network using the GRAPE algorithm, we discover the function that maps any single-qubit gate to its corresponding pulse shape. This model enables the real-time generation of arbitrary single-qubit pulses. When combined with the GRAPE-generated pulse for the CNOT gate, it creates a comprehensive and effective set of universal gates. This set can efficiently implement any algorithm in noisy intermediate-scale quantum computers (NISQ era), thereby enhancing the capabilities of quantum optimal control in this domain. Additionally, this approach can be extended to other quantum computer platforms with similar Hamiltonians.

quant-ph↗

arXiv2023

Quantum Multiplication Algorithm Based on the Convolution Theorem

The problem of efficient multiplication of large numbers has been a long-standing challenge in classical computation and has been extensively studied for centuries. It appears that the existing classical algorithms are close to their theoretical limit and offer little room for further enhancement. However, with the advent of quantum computers and the need for quantum algorithms that can perform multiplication on quantum hardware, a new paradigm emerges. In this paper, inspired by convolution theorem and quantum amplitude amplification paradigm we propose a quantum algorithms for integer multiplication with time complexity $O(\sqrt{n}\log^2 n)$ which outperforms the best-known classical algorithm, the Harvey algorithm with time complexity of $O(n \log n)$. Unlike the Harvey algorithm, our algorithm does not have the restriction of being applicable solely to extremely large numbers, making it a versatile choice for a wide range of integer multiplication tasks. The paper also reviews the history and development of classical multiplication algorithms and motivates us to explore how quantum resources can provide new perspectives and possibilities for this fundamental problem.

quant-ph↗

arXiv2022

Continuous quantum clock with high precision and long recurrence time

Continuous clocks, i.e. the clocks that measure time in a continuous manner, are regarded as an essential component of sensing technology. Precision and recurrence time are two basic features of continuous clocks. In this paper, in the framework of quantum estimation theory various models for continuous quantum clocks are proposed, where all tools of quantum estimation theory are employed to seek the characteristics of clocks with high precision and long recurrence time. Then, in a resource-based approach, the performance of the proposed models is compared. It is shown that quantum clocks based on $n$ two-qubits system not only can have better precision than quantum clocks based on $2n$ one-qubit system but also support long recurrence time. Finally, it is shown that while employing the number of $n$ entangled qubits improves the precision of clocks by a factor of $1/\sqrt n $, it inevitably worsens the recurrence time of the clock.

quant-ph↗

arXiv2020

Optimal exploitation of the resource in remote state preparation

Transmission efficiency (TE) of remote state preparation (RSP) with a shared quantum state and one bit of classical communication is considered. Following [B. Daki et al., Nat. Phys. 8, 666 (2012)], the encoding and decoding strategies of the protocol are restricted to the physically relevant classes of projective measurements and unitary operators, respectively. It is shown that contrary to the previous arguments, the quadratic fidelity as well as the linear fidelity could be a valid figure of merit to quantify the TE of RSP. Then, the TE of the protocol in terms of both linear and quadratic fidelities is evaluated in a fully optimized scenario which includes the maximization over the encoding parameters as well as a meaningful maximization over the decoding parameters. The results show that in this scenario, the TE scales with the sum of the two largest eigenvalues of the squared correlation matrix of the resource state that is zero only for product states. This approach successfully quantifies the performance of the protocol in terms of the resource state parameters and provides a means to compare the usefulness of any two resource states for RSP.

quant-ph↗