Searcharxiv⌕ Search

arXiv subjects

Apoorva Patel

Publications and source records attributed to Apoorva Patel.

At least 37 records · Page 2Linked to original sources

Optimal Database Search: Waves and Catalysis

Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.

quant-ph↗

A new algorithm for fixed point quantum search

The standard quantum search lacks a feature, enjoyed by many classical algorithms, of having a fixed point, i.e. monotonic convergence towards the solution. Recently a fixed point quantum search algorithm has been discovered, referred to as the Phase-$π/3$ search algorithm, which gets around this limitation. While searching a database for a target state, this algorithm reduces the error probability from $ε$ to $ε^{2q+1}$ using $q$ oracle queries, which has since been proved to be asymptotically optimal. A different algorithm is presented here, which has the same worst-case behavior as the Phase-$π/3$ search algorithm but much better average-case behavior. Furthermore the new algorithm gives $ε^{2q+1}$ convergence for all integral $q$, whereas the Phase-$π/3$ search algorithm requires $q$ to be $(3^{n}-1)/2$ with $n$ a positive integer. In the new algorithm, the operations are controlled by two ancilla qubits, and fixed point behavior is achieved by irreversible measurement operations applied to these ancillas. It is an example of how measurement can allow us to bypass some restrictions imposed by unitarity on quantum computing.

quant-ph↗

Quantum Algorithms with Fixed Points: The Case of Database Search

The standard quantum search algorithm lacks a feature, enjoyed by many classical algorithms, of having a fixed-point, i.e. a monotonic convergence towards the solution. Here we present two variations of the quantum search algorithm, which get around this limitation. The first replaces selective inversions in the algorithm by selective phase shifts of $\fracπ{3}$. The second controls the selective inversion operations using two ancilla qubits, and irreversible measurement operations on the ancilla qubits drive the starting state towards the target state. Using $q$ oracle queries, these variations reduce the probability of finding a non-target state from $ε$ to $ε^{2q+1}$, which is asymptotically optimal. Similar ideas can lead to robust quantum algorithms, and provide conceptually new schemes for error correction.

quant-ph↗

Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor

Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover's search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, using the local adiabatic evolution, the algorithms given by J. Roland and N. J. Cerf for Grover's search [ Phys. Rev. A. {\bf 65} 042308(2002)] and by Saurya Das, Randy Kobes and Gabor Kunstatter for the Deutsch-Jozsa algorithm [Phys. Rev. A. {\bf 65}, 062301 (2002)], yield a complexity of order $\sqrt{N}$ (where N=2$^{\rm n}$ and n is the number of qubits). In this paper we report the experimental implementation of these local adiabatic evolution algorithms on a two qubit quantum information processor, by Nuclear Magnetic Resonance.

quant-ph↗

Quantum Random Walks without a Coin Toss

We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of classical randomised algorithms. We use this algorithm to search for a marked vertex on a hypercubic lattice in arbitrary dimensions. Our numerical and analytical results match the scaling behaviour of earlier algorithms that use a coin toss instruction.

quant-ph↗

The Future of Computation

``The purpose of life is to obtain knowledge, use it to live with as much satisfaction as possible, and pass it on with improvements and modifications to the next generation.'' This may sound philosophical, and the interpretation of words may be subjective, yet it is fairly clear that this is what all living organisms--from bacteria to human beings--do in their life time. Indeed, this can be adopted as the information theoretic definition of life. Over billions of years, biological evolution has experimented with a wide range of physical systems for acquiring, processing and communicating information. We are now in a position to make the principles behind these systems mathematically precise, and then extend them as far as laws of physics permit. Therein lies the future of computation, of ourselves, and of life.

quant-ph↗

Quantum Random Walks do not need a Coin Toss

Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement from the algorithm, and the results match those obtained with a quantum coin toss instruction.

quant-ph↗

Information Processing beyond Quantum Computation

Recent developments in quantum computation have made it clear that there is a lot more to computation than the conventional Boolean algebra. Is quantum computation the most general framework for processing information? Having gathered the courage to go beyond the traditional definitions, we are now in a position to answer: Certainly not. The meaning of a message being ``a collection of building blocks'' can be explored in a variety of situations. A generalised framework is proposed based on group theory, and it is illustrated with well-known physical examples. A systematic information theoretical approach is yet to be developed in many of these situations. Some directions for future development are pointed out.

quant-ph↗

The Triplet Genetic Code had a Doublet Predecessor

Information theoretic analysis of genetic languages indicates that the naturally occurring 20 amino acids and the triplet genetic code arose by duplication of 10 amino acids of class-II and a doublet genetic code having codons NNY and anticodons $\overleftarrow{\rm GNN}$. Evidence for this scenario is presented based on the properties of aminoacyl-tRNA synthetases, amino acids and nucleotide bases.

q-bio.GN↗

A Transverse Lattice QCD Model for Mesons

QCD is analysed with two light-front continuum dimensions and two transverse lattice dimensions. In the limit of large number of colours and strong transverse gauge coupling, the contributions of light-front and transverse directions factorise in the dynamics, and the theory can be analytically solved in a closed form. An integral equation is obtained, describing the properties of mesons, which generalises the 't Hooft equation by including spin degrees of freedom. The meson spectrum, light-front wavefunctions and form factors can be obtained by solving this equation numerically. These results would be a good starting point to model QCD observables which only weakly depend on transverse directions, e.g. deep inelastic scattering structure functions.

hep-lat↗

Role of Horizons in Semiclassical Gravity: Entropy and the Area Spectrum

In any space-time, it is possible to have a family of observers who have access to only part of the space-time manifold, because of the existence of a horizon. We demand that \emph{physical theories in a given coordinate system must be formulated entirely in terms of variables that an observer using that coordinate system can access}. In the coordinate frame in which these observers are at rest, the horizon manifests itself as a (coordinate) singularity in the metric tensor. Regularization of this singularity removes the inaccessible region, and leads to the following consequences: (a) The non-trivial topological structure for the effective manifold allows one to obtain the standard results of quantum field theory in curved space-time. (b) In case of gravity, this principle requires that the effect of the unobserved degrees of freedom should reduce to a boundary contribution $A_{\rm boundary}$ to the gravitational action. When the boundary is a horizon, $A_{\rm boundary}$ reduces to a single, well-defined term proportional to the area of the horizon. Using the form of this boundary term, it is possible to obtain the full gravitational action in the semiclassical limit. (c) This boundary term must have a quantized spectrum with uniform spacing, $ΔA_{boundary}=2π\hbar$, in the semiclassical limit. This, in turn, yields the following results for semiclassical gravity: (i) The area of any one-way membrane is quantized. (ii) The information hidden by a one-way membrane amounts to an entropy, which is always one-fourth of the area of the membrane in the leading order. (iii) In static space-times, the action for gravity can be given a purely thermodynamic interpretation and the Einstein equations have a formal similarity to laws of thermodynamics.

gr-qc↗

Semiclassical quantization of gravity I: Entropy of horizons and the area spectrum

The principle of equivalence provides a description of gravity in terms of the metric tensor and determines how gravity affects the light cone structure of the space-time. This, in turn, leads to the existence of observers (in any space-time) who do not have access to regions of space-time bounded by horizons. To take into account this generic possibility, it is necessary to demand that \emph{physical theories in a given coordinate system must be formulated entirely in terms of variables that an observer using that coordinate system can access}. This principle is powerful enough to obtain the following results: (a) The action principle of gravity must be of such a structure that, in the semiclassical limit, the action of the unobserved degrees of freedom reduces to a boundary contribution $A_{\rm boundary}$ obtained by integrating a four divergence. (b) When the boundary is a horizon, $A_{\rm boundary}$ essentially reduces to a single, well-defined, term. (c) This boundary term must have a quantized spectrum with uniform spacing, $ΔA_{boundary}=2π\hbar$, in the semiclassical limit. Using this principle in conjunction with the usual action principle in gravity, we show that: (i) The area of any one-way membrane is quantized. (ii) The information hidden by a one-way membrane leads to an entropy which is always one-fourth of the area of the membrane, in the leading order. (iii) In static space-times, the action for gravity can be given a purely thermodynamic interpretation and the Einstein equations have a formal similarity to laws of thermodynamics.

hep-th↗

Mathematical Physics and Life

It is a fascinating subject to explore how well we can understand the processes of life on the basis of fundamental laws of physics. It is emphasised that viewing biological processes as manipulation of information extracts their essential features. This information processing can be analysed using well-known methods of computer science. The lowest level of biological information processing, involving DNA and proteins, is the easiest one to link to physical properties. Physical underpinnings of the genetic information that could have led to the universal language of 4 nucleotide bases and 20 amino acids are pointed out. Generalisations of Boolean logic, especially features of quantum dynamics, play a crucial role.

quant-ph↗

Survival of the Fittest and Zero Sum Games

Competition for available resources is natural amongst coexisting species, and the fittest contenders dominate over the rest in evolution. The dynamics of this selection is studied using a simple linear model. It has similarities to features of quantum computation, in particular conservation laws leading to destructive interference. Compared to an altruistic scenario, competition introduces instability and eliminates the weaker species in a finite time.

quant-ph↗

Carbon--The First Frontier of Information Processing

Information is often encoded as an aperiodic chain of building blocks. Modern digital computers use bits as the building blocks, but in general the choice of building blocks depends on the nature of the information to be encoded. What are the optimal building blocks to encode structural information? This can be analysed by substituting the operations of addition and multiplication of conventional arithmetic with translation and rotation. It is argued that at the molecular level, the best component for encoding discretised structural information is carbon. Living organisms discovered this billions of years ago, and used carbon as the back-bone for constructing proteins that function according to their structure. Structural analysis of polypeptide chains shows that an efficient and versatile structural language of 20 building blocks is needed to implement all the tasks carried out by proteins. Properties of amino acids indicate that the present triplet genetic code was preceded by a more primitive one, coding for 10 amino acids using two nucleotide bases.

quant-ph↗

Mesons in Transverse Lattice QCD at Strong Coupling and Large-N

Mesons in large-N QCD are analysed in light-front coordinates with a transverse lattice at strong coupling. In this limit, their properties can be expressed as simple renormalisations of the 't Hooft model results. The integral eigenvalue equation for the mesons is derived. Spectrum, lightcone wavefunctions and form factors of various mesons can be numerically calculated from this equation.

hep-lat↗

Why Genetic Information Processing could have a Quantum Basis

Living organisms are not just random collections of organic molecules. There is continuous information processing going on in the apparent bouncing around of molecules of life. Optimisation criteria in this information processing can be searched for using the laws of physics. Quantum dynamics can explain why living organisms have 4 nucleotide bases and 20 amino acids, as optimal solutions of the molecular assembly process. Experiments should be able to tell whether evolution indeed took advantage of quantum dynamics or not.

quant-ph↗