Search

In this paper, we introduce a quantum decomposition algorithm (QDA) that decomposes the problem ∂ ρ ∂ t = ℒ ρ = λ ρ into a summation of eigenvalues times phase–space variables. One interesting feature of QDA stems from its ability to simulate damped spin systems by means of pure quantum harmonic oscillators adjusted with the eigenvalues of the original eigenvalue problem. We test the proposed algorithm in the case of undriven qubit with spontaneous emission and dephasing. [ABSTRACT FROM AUTHOR]

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]

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]

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]

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]

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]

In this paper, we have presented an algorithm to generate various black hole solutions in general relativity and alternative theories of gravity. The algorithm involves few dimensional parameters that are assigned suitable values to specify the required black hole. [ABSTRACT FROM AUTHOR]

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]

In this paper, we review briefly recent progress made in realizing local(ized around a mobile spacetime filling D3-brane in) D3/D7 μ-split Supersymmetry in (the large volume limit of Type IIB) String Theory (compactified on Swiss-Cheese Calabi-Yau orientifolds) as well as obtaining a 125 GeV (light) Higgs in the same setup. We also discuss obtaining the geometric Kähler potential (and hence the Ricci-flat metric) for the Swiss-Cheese Calabi-Yau in the large volume limit using the Donaldson's algorithm and intuition from GLSM-based calculations - we present new results for Swiss-Cheese Calabi-Yau (used in the setup) metrics at points finitely away from the "big" divisor. [ABSTRACT FROM AUTHOR]

Inverse spectral problem for the Dirac equation with quark–antiquark potential is treated. For a class of potentials of the form Q(x) = q(x) E + (m + x)I, where q(x) = o(1) for x → +∞, $I=\hbox{\scriptsize$\pmatrix{1 & \phantom{-}0\cr 0 &-1\cr}$}$, E = I2 is multiplicative identity matrix, it is proved that q(x) in the Dirac equation can be uniquely recovered from the data {λj, sj}. Here λj are the eigenvalues of the Dirac equation and sj are the values yj(0) = (sj, 0)T, where yj(x) are the normalized eigenfunctions of the Dirac Hamiltonian, $\int_0^\infty|y_j(x)|^2\, dx = 1$. An algorithm for finding q(x) from the known first few data, corresponding to -J ≤ j ≤ J assuming that the rest of the data are the same as for q0(x):= 0, m = 0 is proposed. [ABSTRACT FROM AUTHOR]

An algorithm for numerical computation of the barrier transparency for the potentials surrounding Schwarzschild black holes is described for massless spinor particles. It is then applied to calculate all the configurations (including the contributions of twisted field configurations connected with Dirac monopoles) luminosity for the Hawking radiation from a Schwarzschild black hole. It is found that the contribution due to monopoles can be of order 22% of all the configurations luminosity. [ABSTRACT FROM AUTHOR]

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]

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]