9 results
Search Results
2. Multiparty quantum key agreement based on Grover's algorithm and its implementation.
- Author
-
Yin, Aihan and Han, Zhifei
- Subjects
ALGORITHMS ,INFORMATION theory ,AGREEMENT protocols (Computer network protocols) ,SEARCH algorithms ,INVESTMENT analysis - Abstract
Multiparty quantum key agreement (MQKA) is a significant topic that the shared key must be negotiated equally by all participants. In this paper, we use Bell state as quantum resource and add controlled-not gate to avoid information leakage. There is very little research on the quantum key agreement protocol based on quantum search algorithms. Therefore, we propose a quantum key agreement protocol which is based on Grover's algorithm as one of the most famous quantum search algorithms. The security analysis appears very promising. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
3. Killing vector fields of Bianchi type I spacetimes via Rif tree approach.
- Author
-
Bokhari, Ashfaque H., Hussain, Tahir, Hussain, Wajid, and Khan, Fawad
- Subjects
VECTOR fields ,EINSTEIN field equations ,LIE algebras ,ALGORITHMS - Abstract
In this paper, we have adopted a new approach to study the Killing vector fields of locally rotationally symmetric and general Bianchi type I spacetimes. Instead of directly integrating the set of Killing's equations, an algorithm is developed in Maple which converts these equations to the reduced involutive form (Rif) and consequently it imposes some restrictions on the metric functions in the form of a tree, known as Rif tree. The set of Killing's equations is then solved for each branch of the Rif tree, giving the explicit form of the Killing vector fields. The structure of Lie algebra is presented for each set of the obtained Killing vector fields and some physical implications of the obtained metrics are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
4. A study on the estimations of (n, t) reaction cross-sections at 14.5 MeV by using artificial neural network.
- Author
-
Özdoğan, Hasan, Üncü, Yiğit Ali, Şekerci, Mert, and Kaplan, Abdullah
- Subjects
ARTIFICIAL neural networks ,NON-equilibrium reactions ,ALGORITHMS - Abstract
In this paper, calculations of the (n , t) reaction cross-sections at 14.5 MeV have been presented by utilizing artificial neural network algorithms (ANNs). The systematics are based on the account for the non-equilibrium reaction mechanism and the corresponding analytical formulas of the pre-equilibrium exciton model. Experimental results, obtained from the EXFOR database, have been used to train the ANN with the Levenberg–Marquardt (LM) algorithm which is a feed-forward algorithm and is considered one of the well-known and most effective methods in neural networks. The Regression (R) values for the ANN estimation have been determined as 0.9998, 0.9927 and 0.9895 for training, testing and for all process. The (n , t) reaction cross-sections have been reproduced with the TALYS 1.95 and the EMPIRE 3.2 codes. In summary, it has been demonstrated that the ANN algorithms can be used to calculate the (n , t) reaction cross-section with the semi-empirical systematics. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
5. Quantum image interest point extraction.
- Author
-
Jiang, Nan, Ji, Zhuoxiao, Li, Hong, and Wang, Jian
- Subjects
IMAGE processing ,QUANTUM computing ,ABSOLUTE value ,PIXELS ,ALGORITHMS - Abstract
With the development of quantum computing, the application of it to image processing has lots of advantages compared to classical image processing. In this paper, we propose a scheme to extract the interest point in quantum images. Interest point is a kind of feature point which can help to identify the target object in the image. Our scheme is based on the idea of Luminance Contrast (LC) algorithm. The scheme computes the absolute value of gray level differences between a pixel and the others, and then adds all these differences together. The sum is defined as a saliency. After computing the saliency of every pixel, we label the pixels with the maximal saliency as the interest points. The algorithm has pretty good performance and its time complexity is much better than the classical algorithm in same conditions, which provides a new idea for the extraction of image interest point. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
6. A quantum segmentation algorithm based on local adaptive threshold for NEQR image.
- Author
-
Wang, Lu and Liu, Wenjie
- Subjects
- *
THRESHOLDING algorithms , *ALGORITHMS , *IMAGE segmentation , *QUANTUM gates , *QUBITS , *IMAGE processing - Abstract
The classical image segmentation algorithm based on local adaptive threshold can effectively segment images with uneven illumination, but with the increase of the image data, the real-time problem gradually emerges. In this paper, a quantum segmentation algorithm based on local adaptive threshold for NEQR image is proposed, which can use quantum mechanism to simultaneously compute local thresholds for all pixels in a gray-scale image and quickly segment the image into a binary image. In addition, several quantum circuit units, including median calculation, quantum binarization, etc. are designed in detail, and then a complete quantum circuit is designed to segment NEQR images by using fewer qubits and quantum gates. For a 2 n × 2 n image with q gray-scale levels, the complexity of our algorithm can be reduced to O (n 2 + q) , which is an exponential speedup compared to the classic counterparts. Finally, the experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. Controlled bidirectional quantum secure direct communication protocol based on Grover's algorithm.
- Author
-
Yin, Aihan, Lin, Weibin, He, Kemeng, Han, Zhifei, and Fan, Ping
- Subjects
- *
ALGORITHMS , *QUANTUM states , *INFORMATION resources , *QUANTUM noise , *QUANTUM gates , *LEAKAGE - Abstract
A novel controlled bidirectional quantum secure direct communication (CBQSDC) protocol based on Grover's algorithm is proposed in our paper, which is on the basis of investigating the properties of it. To avoid information leakage, the strategy of adding control-not gate is employed in our protocol. The proposed protocol uses Bell state as quantum resource to transmit information in a dual-quantum-channel. Through the proposed measures, we can not only prevent information leakage, but also improve the efficiency of transmission. As can be shown from the security analysis, the Grover's algorithm has great application prospects in the research of CBQSDC. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
8. A classical limit of Grover's algorithm induced by dephasing: Coherence versus entanglement.
- Author
-
Fujikawa, Kazuo, Oh, C. H., and Umetsu, Koichiro
- Subjects
QUANTUM computing ,QUANTUM states ,ALGORITHMS ,QUANTUM coherence - Abstract
A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can identify a specific element among N unsorted elements by a probability of the order of unity after k ∼ N steps of classical amplification, which is realized by a combination of Grover's unitary operation and rapid dephasing, in contrast to k ∼ π N / 4 steps in quantum mechanical amplification. The initial two-state system with enormously unbalanced existence probabilities, which is realized by a chosen specific state and a superposition of all the rest of the states among N unsorted states, is crucial in the present analysis of classical amplification. This analysis illustrates Grover's algorithm in extremely noisy circumstances. A similar increase from k ∼ N to k ∼ N steps due to the loss of quantum coherence takes place in the analog model of Farhi and Gutmann where the entanglement does not play an obvious role. This supports a view that entanglement is crucial in quantum computation to describe quantum states by a set of qubits, but the actual speedup of the quantum computation is based on quantum coherence. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. A field theoretic approach to the energy-momentum-tensor for theories coupled with gravity.
- Author
-
Mukherjee, Pradip, Saha, Anirban, and Roy, Amit Singha
- Subjects
SCALAR field theory ,TENSOR algebra ,GRAVITATION ,ALGORITHMS ,MAGNETIC coupling ,MATHEMATICAL functions - Abstract
We provide a field-theoretic algorithm of obtaining energy-momentum-tensor (EMT) for gravitationally coupled scalar field theories. The method is equally applicable to both minimal and non-minimal coupling. The algorithm illuminates the connection between the EMT, obtained by functional variation of the metric, and local balance of energy and momentum. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.