scholarly journals A classical limit of Grover’s algorithm induced by dephasing: Coherence versus entanglement

2019 ◽  
Vol 34 (07n08) ◽  
pp. 1950146
Author(s):  
Kazuo Fujikawa ◽  
C. H. Oh ◽  
Koichiro Umetsu
Keyword(s):  
Quantum Computation ◽  
Classical Limit ◽  
Quantum Coherence ◽  
Quantum States ◽  
Mixed States ◽  
Grover’S Algorithm ◽  
Specific Element ◽  
New Approach ◽  
Mechanical Amplification ◽  
Grover's Algorithm

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 [Formula: see text] unsorted elements by a probability of the order of unity after [Formula: see text] steps of classical amplification, which is realized by a combination of Grover’s unitary operation and rapid dephasing, in contrast to [Formula: see text] 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 [Formula: see text] 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 [Formula: see text] to [Formula: see text] 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.

scholarly journals Coherent preorder of quantum states

2020 ◽  
Vol 20 (13&14) ◽  
pp. 1124-1137
Author(s):  
Zhaofang Bai ◽  
Shuanping Shuanping Du
Keyword(s):  
Information Processing ◽  
Quantum Information ◽  
Coherent States ◽  
Quantum Coherence ◽  
Quantum Information Processing ◽  
Quantum States ◽  
Mixed States ◽  
Quantum Hypothesis ◽  
Quantum Hypothesis Testing

As an important quantum resource, quantum coherence play key role in quantum information processing. It is often concerned with manipulation of families of quantum states rather than individual states in isolation. Given two pairs of coherent states $(\rho_1,\rho_2)$ and $(\sigma_1,\sigma_2)$, we are aimed to study how can we determine if there exists a strictly incoherent operation $\Phi$ such that $\Phi(\rho_i) =\sigma_i,i = 1,2$. This is also a classic question in quantum hypothesis testing. In this note, structural characterization of coherent preorder under strongly incoherent operations is provided. Basing on the characterization, we propose an approach to realize coherence distillation from rank-two mixed coherent states to $q$-level maximally coherent states. In addition, one scheme of coherence manipulation between rank-two mixed states is also presented.

scholarly journals Holistic Type Extension for Classical Logic via Toffoli Quantum Gate

Entropy ◽  
2019 ◽  
Vol 21 (7) ◽  
pp. 636 ◽  
Author(s):  
Hector Freytes ◽  
Roberto Giuntini ◽  
Giuseppe Sergioli
Keyword(s):  
Quantum Computation ◽  
Classical Logic ◽  
Propositional Logic ◽  
Quantum States ◽  
Quantum Gate ◽  
Logical System ◽  
Classical Propositional Logic ◽  
Mixed States ◽  
Werner States ◽  
To Receive

A holistic extension of classical propositional logic is introduced via Toffoli quantum gate. This extension is based on the framework of the so-called “quantum computation with mixed states”, where also irreversible transformations are taken into account. Formal aspects of this new logical system are detailed: in particular, the concepts of tautology and contradiction are investigated in this extension. These concepts turn out to receive substantial changes due to the non-separability of some quantum states; as an example, Werner states emerge as particular cases of “holistic" contradiction.

On quantum one-way permutations

2002 ◽  
Vol 2 (5) ◽  
pp. 379-398
Author(s):  
E. Kashefi ◽  
H. Nishimura ◽  
V. Vedral
Keyword(s):  
Quantum States ◽  
Grover’S Algorithm ◽  
Worst Case ◽  
Quantum Networks ◽  
Average Case ◽  
Case Complexity ◽  
Polynomial Size ◽  
Average Case Complexity ◽  
Grover's Algorithm ◽  
The Relationship

\We discuss the question of the existence of quantum one-way permutations. First, we consider the question: if a state is difficult to prepare, is the reflection operator about that state difficult to construct? By revisiting Grover's algorithm, we present the relationship between this question and the existence of quantum one-way permutations. Next, we prove the equivalence between inverting a permutation and that of constructing polynomial size quantum networks for reflection operators about a class of quantum states. We will consider both the worst case and the average case complexity scenarios for this problem. Moreover, we compare our method to Grover's algorithm and discuss possible applications of our results.

scholarly journals A Quantum interpretation of separating conjunction for local reasoning of Quantum programs based on separation logic

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-27
Author(s):  
Xuan-Bach Le ◽  
Shang-Wei Lin ◽  
Jun Sun ◽  
David Sanan
Keyword(s):  
State Space ◽  
The State ◽  
Quantum States ◽  
Separation Logic ◽  
Grover’S Algorithm ◽  
State Space Explosion ◽  
Grover's Algorithm ◽  
Local Reasoning ◽  
Quantum Interpretation ◽  
Exponential Size

It is well-known that quantum programs are not only complicated to design but also challenging to verify because the quantum states can have exponential size and require sophisticated mathematics to encode and manipulate. To tackle the state-space explosion problem for quantum reasoning, we propose a Hoare-style inference framework that supports local reasoning for quantum programs. By providing a quantum interpretation of the separating conjunction, we are able to infuse separation logic into our framework and apply local reasoning using a quantum frame rule that is similar to the classical frame rule. For evaluation, we apply our framework to verify various quantum programs including Deutsch–Jozsa’s algorithm and Grover's algorithm.

scholarly journals Understanding mathematics of Grover’s algorithm

2021 ◽  
Vol 20 (5) ◽  
Author(s):  
Paweł J. Szabłowski
Keyword(s):  
Phase Change ◽  
Unitary Operator ◽  
Mathematical Structure ◽  
Complex Numbers ◽  
Unitary Operators ◽  
Grover’S Algorithm ◽  
Great Probability ◽  
Grover's Algorithm ◽  
One Step ◽  
The One

AbstractWe analyze the mathematical structure of the classical Grover’s algorithm and put it within the framework of linear algebra over the complex numbers. We also generalize it in the sense, that we are seeking not the one ‘chosen’ element (sometimes called a ‘solution’) of the dataset, but a set of m such ‘chosen’ elements (out of $$n>m)$$ n > m ) . Besides, we do not assume that the so-called initial superposition is uniform. We assume also that we have at our disposal an oracle that ‘marks,’ by a suitable phase change $$\varphi $$ φ , all these ‘chosen’ elements. In the first part of the paper, we construct a unique unitary operator that selects all ‘chosen’ elements in one step. The constructed operator is uniquely defined by the numbers $$\varphi $$ φ and $$\alpha $$ α which is a certain function of the coefficients of the initial superposition. Moreover, it is in the form of a composition of two so-called reflections. The result is purely theoretical since the phase change required to reach this heavily depends on $$\alpha $$ α . In the second part, we construct unitary operators having a form of composition of two or more reflections (generalizing the constructed operator) given the set of orthogonal versors. We find properties of these operations, in particular, their compositions. Further, by considering a fixed, ‘convenient’ phase change $$\varphi ,$$ φ , and by sequentially applying the so-constructed operator, we find the number of steps to find these ‘chosen’ elements with great probability. We apply this knowledge to study the generalizations of Grover’s algorithm ($$m=1,\phi =\pi $$ m = 1 , ϕ = π ), which are of the form, the found previously, unitary operators.

scholarly journals Quantum Information in Neural Systems

Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 773
Author(s):  
Danko D. Georgiev
Keyword(s):  
Quantum Entanglement ◽  
Quantum Coherence ◽  
Quantum Physics ◽  
Quantitative Measure ◽  
Quantum States ◽  
Quantum Evolution ◽  
Einstein Relation ◽  
Schmidt Decomposition ◽  
The Central Nervous System ◽  
The Individual

Identifying the physiological processes in the central nervous system that underlie our conscious experiences has been at the forefront of cognitive neuroscience. While the principles of classical physics were long found to be unaccommodating for a causally effective consciousness, the inherent indeterminism of quantum physics, together with its characteristic dichotomy between quantum states and quantum observables, provides a fertile ground for the physical modeling of consciousness. Here, we utilize the Schrödinger equation, together with the Planck–Einstein relation between energy and frequency, in order to determine the appropriate quantum dynamical timescale of conscious processes. Furthermore, with the help of a simple two-qubit toy model we illustrate the importance of non-zero interaction Hamiltonian for the generation of quantum entanglement and manifestation of observable correlations between different measurement outcomes. Employing a quantitative measure of entanglement based on Schmidt decomposition, we show that quantum evolution governed only by internal Hamiltonians for the individual quantum subsystems preserves quantum coherence of separable initial quantum states, but eliminates the possibility of any interaction and quantum entanglement. The presence of non-zero interaction Hamiltonian, however, allows for decoherence of the individual quantum subsystems along with their mutual interaction and quantum entanglement. The presented results show that quantum coherence of individual subsystems cannot be used for cognitive binding because it is a physical mechanism that leads to separability and non-interaction. In contrast, quantum interactions with their associated decoherence of individual subsystems are instrumental for dynamical changes in the quantum entanglement of the composite quantum state vector and manifested correlations of different observable outcomes. Thus, fast decoherence timescales could assist cognitive binding through quantum entanglement across extensive neural networks in the brain cortex.

scholarly journals A framework for reducing the overhead of the quantum oracle for use with Grover’s algorithm with applications to cryptanalysis of SIKE

2020 ◽  
Vol 15 (1) ◽  
pp. 143-156
Author(s):  
Jean-François Biasse ◽  
Benjamin Pring
Keyword(s):  
Search Algorithm ◽  
Circuit Complexity ◽  
Quantum Circuit ◽  
Grover’S Algorithm ◽  
Search Problems ◽  
Trade Offs ◽  
Single Target ◽  
Grover's Algorithm ◽  
Quantum Oracle ◽  
The Cost

AbstractIn this paper we provide a framework for applying classical search and preprocessing to quantum oracles for use with Grover’s quantum search algorithm in order to lower the quantum circuit-complexity of Grover’s algorithm for single-target search problems. This has the effect (for certain problems) of reducing a portion of the polynomial overhead contributed by the implementation cost of quantum oracles and can be used to provide either strict improvements or advantageous trade-offs in circuit-complexity. Our results indicate that it is possible for quantum oracles for certain single-target preimage search problems to reduce the quantum circuit-size from $O\left(2^{n/2}\cdot mC\right)$ (where C originates from the cost of implementing the quantum oracle) to $O(2^{n/2} \cdot m\sqrt{C})$ without the use of quantum ram, whilst also slightly reducing the number of required qubits.This framework captures a previous optimisation of Grover’s algorithm using preprocessing [21] applied to cryptanalysis, providing new asymptotic analysis. We additionally provide insights and asymptotic improvements on recent cryptanalysis [16] of SIKE [14] via Grover’s algorithm, demonstrating that the speedup applies to this attack and impacting upon quantum security estimates [16] incorporated into the SIKE specification [14].

Global Optimization With Quantum Walk Enhanced Grover Search

2014 ◽  
Author(s):  
Yan Wang
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Early Stage ◽  
Hybrid Approach ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Tunneling Effect ◽  
Grover’S Algorithm ◽  
Grover's Algorithm ◽  
Grover Search

One of the significant breakthroughs in quantum computation is Grover’s algorithm for unsorted database search. Recently, the applications of Grover’s algorithm to solve global optimization problems have been demonstrated, where unknown optimum solutions are found by iteratively improving the threshold value for the selective phase shift operator in Grover rotation. In this paper, a hybrid approach that combines continuous-time quantum walks with Grover search is proposed. By taking advantage of quantum tunneling effect, local barriers are overcome and better threshold values can be found at the early stage of search process. The new algorithm based on the formalism is demonstrated with benchmark examples of global optimization. The results between the new algorithm and the Grover search method are also compared.

scholarly journals SPIN–MOMENTUM CORRELATION IN RELATIVISTIC SINGLE-PARTICLE QUANTUM STATES

2010 ◽  
Vol 08 (03) ◽  
pp. 517-528 ◽  
Author(s):  
M. A. JAFARIZADEH ◽  
M. MAHDIAN
Keyword(s):  
Single Particle ◽  
Inertial Frame ◽  
Quantum States ◽  
Moving Frame ◽  
Lorentz Transformations ◽  
Mixed States ◽  
Wigner Rotation ◽  
Lorentz Boost ◽  
Momentum Correlation ◽  
Spin Momentum

This paper is concerned with the spin–momentum correlation in single-particle quantum states, which is described by the mixed states under Lorentz transformations. For convenience, instead of using the superposition of momenta we use only two momentum eigenstates (p1 and p2) that are perpendicular to the Lorentz boost direction. Consequently, in 2D momentum subspace we show that the entanglement of spin and momentum in the moving frame depends on the angle between them. Therefore, when spin and momentum are perpendicular the measure of entanglement is not an observer-dependent quantity in the inertial frame. Likewise, we have calculated the measure of entanglement (by using the concurrence) and have shown that entanglement decreases with respect to the increase in observer velocity. Finally, we argue that Wigner rotation is induced by Lorentz transformations and can be realized as a controlling operator.

Sign in / Sign up

Export Citation Format

Share Document