Technical Comments

Does Rydberg State Manipulation Equal Quantum Computation?

Science  01 Sep 2000:
Vol. 289, Issue 5484, pp. 1431
DOI: 10.1126/science.289.5484.1431a

Ahn et al. (1), in describing the experimental search of a database realized with Rydberg atoms, left the misleading impression that the search constituted quantum computation. Their atomic system, in the words of the accompanying Perspective, “can implement [quantum] algorithms” (2) such as the database-search algorithm proposed by Grover (3,4). And, according to Ahn et al. [p. 465 of (1)], “[o]ther algorithms can be implemented by other unitary transformations such as the application of ultrafast shaped terahertz pulses” as described by Tielking and Jones (5).

The system described by Ahn et al., however, cannot implement quantum algorithms any more efficiently than can a classical digital computer. The word “efficiently” in this context refers to how the resources required to implement an algorithm scale with the size of the problem being solved (6). The standard model for quantum computation uses poly-local transformations (7)—implemented, for example, by polynomially many bounded size gates acting on n qubits. These require specification of only polynomially many nontrivial transition amplitudes with constant precision. Any quantum algorithm within this model can also be implemented (on a classical digital computer, for example) by storing the vector of N = 2n complex amplitudes, which represents the quantum state at each time step, and by successively multiplying the state vector by the N-by-N matrix that specifies each unitary transformation. The resources required for such an implementation scale exponentially, rather than polynomially, withn; the classical implementation is therefore less efficient.

The quantum phase manipulation of Rydberg atom states described by Ahnet al. (1) is not quantum computation because, like this classical implementation, it scales badly with the size of the problem—the number of bits, n = log N, defining the size of the quantum register being searched. This scaling is somewhat subtle because it has two causes, one of which Ahn et al. partly acknowledged and the other of which they did not discuss.

First, the number of atoms they used for each shot at the single-query Grover algorithm (4) wasN min ≈ (2ɛ)−1 ≈ 100. To achieve acceptable success rates, Ahn et al. found that increasing Nrequires increasing numbers of shots [figure 3 of (1)] or, equivalently, more atoms. In fact, because ɛ =O(1/Embedded Image), Grover showed that the number of N-state quantum systems required scales at least asN log N (4); this single-query algorithm is thus no more efficient than a classical algorithm for the same problem, which is why only Grover'sO(Embedded Image) query algorithm (3) is the one usually discussed in the quantum computing literature (8).

Second, there is also an exponential price for removing entanglement from Grover's algorithms (9, 10), which commonly is paid with exponentially increasing mass/energy (11). Using N Rydberg states rather than n qubits realizes Lloyd's scheme for removing entanglement (9), but Ahn et al. (1) neglected the exponential overhead required for measurement and for realization ofN-by-N unitary transformations. Because the difference (detuning) between adjacent Rydberg energy levels converges to zero polynomially in 1/N (5), both the laser pulses and the final measurements must be specified with exponentially increasing precision in n.

To the best of our knowledge, all physically realized computation is quantum mechanical—but that does not make every computer a quantum computer. A quantum system such as a Rydberg atom that implements a quantum algorithm no more efficiently than a classical computer is not performing quantum computation.

REFERENCES AND NOTES

Ahn et al. (1) described an experimental implementation of an algorithm to search for the marked element in a database with ∼7 elements. The labels for the N database elements were represented as amplitudes of Rydberg states of individual cesium atoms, a large ensemble of which were examined to determine the marked element. The report (1) and the accompanying Perspective (2) characterized the results as an implementation of Grover's second quantum search algorithm (3) and as a method for storing information in a “single quantum system.” Although we are impressed with the experimental control over Rydberg states, we disagree with these assertions. The reported experiment did not implement the search algorithm as proposed, and offered no computational advantage relative to a classical implementation. It did, however, illuminate the resources required for quantum information processing to achieve an advantage over classical.

Grover's search algorithms (3, 4) rely on the inversion-about-the-mean (IOM) procedure, in which probability amplitude is transferred from each unmarked database element to the marked element. If each of the N elements has an initial amplitude of ɛ, the marked element will have final amplitude ɛ(3 − 4/N). Thus, for large databases, the probability of being in the marked state approaches 9ɛ 2. Ideally, ɛ = 1/Embedded Image, though in the experiment of Ahn et al., ɛ = ∼1/20. More important, their procedure implemented an inversion about ɛ/2 instead of about the mean, transferring amplitude from the unmarked elements into the 7s state, not into the marked state; hence, the final probability of detecting the marked state is only (2ɛ)2. To accomplish genuine IOM requires interference between the different elements of the database—that is, coherent transitions between the various Rydberg states—which was not achieved in the Ahn et al. experiment. Their procedure could therefore be performed equally well with a classical system (Fig. 1).

Figure 1-1

The limitations of the Rydberg scheme are apparent in the equivalent optical version. An extended beam of photons, large enough to cover N distinguishable spatial modes, is sent through a horizontal polarizer. Each spatial mode corresponds to a single Rydberg level; the horizontal (H) polarization corresponds to the 7s reservoir state. Next, the polarization is rotated by an amount δθ, such that ɛ = (sin δθ)/Embedded Image. This prepares each of the elements of the database (the different spatial modes) in the superposition (cos δθ |H〉 + sin δθ |V〉)/Embedded Image, with vertical (V) polarization as the analog of being in a Rydberg state. In one particular spatial mode a birefringent element introduces a relative phase shift of π between the H and V polarization; this “marks” one element of the database by preparing the state |−δθ〉 in that spatial mode, analogous to the “A pulse” in the experiment of Ahn et al. (1). Next, a half waveplate is used toreflect the polarization in each spatial mode about the axis δθ/2; this is the “B pulse.” All unmarked modes are thereby brought back to H polarization; the marked mode is brought to 2δθ. Finally, we analyze all the spatial modes with a vertical polarizer. Only photons in the marked mode have a chance of being detected, with a probability ∼(2δθ)2. Therefore, we need to have enough photons in this mode [> (1/2δθ)2] to have a reasonable chance of detecting one of them. Moreover, we need to have more than N times this many photons in our original beam to ensure that the mode of interest is sufficiently populated. No coherence or interaction between the different spatial modes is necessary, just as it is not necessary between the Rydberg states. Moreover, the entire “algorithm” could just as well be performed with classical light, or even a set of appropriately rotated classical “needles.”

Notwithstanding the suggestion by Knight (2), the IOM procedure itself is not intrinsically nonclassical. As alluded to in (5), physically demonstrated in a classical-optics implementation (6) of Grover's first search algorithm (4), and, finally, discussed for general systems in (7), the same results could be achieved with any system supporting wavelike phenomena, even media such as water or sound. All that are required for these “unary” representations are interacting multiple modes of at least one degree of freedom.

Ahn et al. also speculate on using their Rydberg atoms to store large amounts of information, by allowing multiple Rydberg levels to be marked so that the amplitude of each level represents a bit of information. Many classical bits of information are required, however, to specify the precise pump pulse-shape to prepare the state. Further, information readout requires many replicas: One needs more than 1/(2ɛ)2 (>N/4) atoms in each marked Rydberg level to have a reasonable likelihood of detecting it, and more than N times that number to sample each Rydberg level [Grover (3) showed that N log Natoms are required]. Is it meaningful to say that an N-bit number is stored in a single atom when quantum mechanics requires greater than O(N 2 logN) copies to read out this number?

Finally, Ahn et al. suggest that they can encode more information in their states by using more than just the two phase settings, 0 and π. This is equivalent to the possibility of encoding an infinite amount of information in the polarization state of a single photon. In both cases, however, these many states are no longer orthogonal and cannot be resolved by a measurement on a single system. The uncertainty principle dictates that the number of particles, N, must equal or exceed 1/Δϕ, where Δϕ is the angular resolution. And unless entangled particles are employed (8–10)—certainly not the case for the Rydberg atoms—an even larger number of copies, NO[(1/Δϕ)2], is required owing to Poisson statistics. Consequently, although a single Rydberg atom could in some philosophical sense store one of 3020 numbers, more thanO[(30)2(20)2] = 360,000 copies are required to read it out, a very large number compared with the 100 bits needed to store this information classically. Accounting for the experimental parameters of Ahn et al., the predicted number of copies would be yet another order of magnitude greater.

Three categories of resources would seem to be necessary for quantum information. The first is temporal resources, or the number of operations needed—the number of queries, for example, in the Grover database search. The second is processing resources, or the physical resources to carry out the necessary transformations; this is the resolution of the pulse-shape in the Rydberg case. The third is readout resources, or the number of system copies (for example, Rydberg atoms) required to accurately determine the final state. [Grover (3) calls the second step preprocessing and the third step postprocessing.] Each of the three systems thus far used to implement quantum algorithms—optical, bulk NMR (11–13), and Rydberg atoms—displays savings in temporal resources. Optical implementations (5,6) require processing resources, optical elements, that grow exponentially in the equivalent number of qubits (linear inN), but a single photon is sufficient for readout when implementing Grover's first search algorithm. The bulk NMR systems require an exponential number of readout resources (14–16). To implement their modified version of Grover's algorithm, Ahn et al. require an exponential number of both processing resources and readout resources.

REFERENCES AND NOTES

Response: The comment of Meyer and that of Kwiat and Hughes both hinge on the assertion that quantum computations should exhibit a certain type of scaling that takes advantage of the multiple degrees of freedom in the quantum state space. The use of quantum phase to store information, the comments argue, does not automatically imply favorable scaling for large problems. We agree; indeed, the experiment of Ahn et al. (1) demonstrates that point. In this response, we examine that experiment in the context of the scaling issue, and then address some additional important questions raised by Kwiat and Hughes about quantum mechanics in general.

In the Ahn et al. experiment, binary 1's and 0's were encoded as + and − phases, respectively, of the quantum states in the energy eigenbasis of a Rydberg wave packet. We demonstrated that a universal unitary transformation of the system (executed in this case by a single ultrafast laser pulse incident on an ensemble of Rydberg atoms) exists that can interrogate all of the states at once, and decode the location of the binary 1's in a single step. The Rydberg eigenstates form a unary basis; thus, the degrees of freedom in the atom (three space and two spin) are coupled so that each state in the system can be addressed individually. Each state in the Rydberg data register lies at a different energy, so different states are populated by exciting the ground state of the atom with a different spectral component of the light field. Each spectral component is therefore a separate “control knob” for the problem.

Because of that individuality, a scaling problem arises for large data registers: the number of independent colors that need to be controlled to load a binary number into an N-state register grows linearly with N and, therefore, exponentially with the number of degrees of freedom. In Rydberg atoms, as Meyer points out, the state splittings converge as 1/N, so the required optical resolution diverges as N increases. The number of atoms in the ensemble multiplied by the optical pulse energy must also grow at least linearly with N, because the excitation oscillator strength per unit energy remains roughly constant throughout the Rydberg spectrum.

We stress that the optical-resolution–scaling problem does not exist for the database search itself, but only for the initial loading of the register. That is because the universal decoding transformation is a single ultrafast pulse—an optical pulse with constant spectral phase. The pulse has a continuous frequency distribution, so it retains its effectiveness as the density of Rydberg states increases. Furthermore, as long as the loading and decoding pulses have the same spectral width and total energy, the decoding pulse will be efficient (1).

Because the scaling failure of Rydberg data storage is the fault of the addressing scheme and not of the Rydberg atom itself, the limitation is not fundamental. The unfavorable scaling properties of Rydberg state addressing are overcome in some other physical systems by manipulating the degrees of freedom, rather than the coupled states (2, 3). One successful example is the cooled ion trap (2), in which the number of control knobs grows only as a polynomial power of the number of ions, and therefore as the logarithm of the number of states. Ahn et al. [p. 465 of (1)] raised the possibility that the individual degrees of freedom of Rydberg states might be addressable using terahertz “half-cycle” pulsed radiation. Many unsolved problems remain for the future, however; terahertz pulses have not yet been used to store and retrieve information, for example, and scaling the system to more than five degrees of freedom will require coupling atoms together.

Quite apart from the scaling issue, Kwiat and Hughes raise several other questions about the Ahn et al. experiment and about quantum mechanics in general. Particularly important is the issue of quantum interference, which Kwiat and Hughes claims is not a general feature of these atomic wave packet experiments. We have a different view. The simple fact that two probability amplitudes (in this case, the encoding and decoding amplitudes) can either add or subtract, depending on their phase, plainly implies quantum interference in the Ahn et al. experiment.

Kwiat and Hughes also discuss the quantum process that corresponds to the vector algebraic operation of inversion about the mean. This operation lies at the heart of the data manipulation routines described by Grover (4), who used IOM to transfer probability from the general data state space to the single state representing the marked bit—that is, the state being sought. In the view of Kwiat and Hughes, the use by Ahn et al. (1) of the 7s level of atomic cesium as a repository for most of the quantum probability amplitude violates the IOM operation, because at the end of the retrieval operation the most probable place to find the atom is back in the 7s state.

Use of 7s in this way, however, actually afforded a very important experimental convenience: It allowed Ahn et al. to use perturbation theory formalism to calculate the shape of the decoding wave packet, which transferred all of the probability amplitude out of the unmarked bits and placed additional probability amplitude in the marked bit. Ahn et al. thus accomplished the same result intended by Grover's IOM, because the only Rydberg population remaining after this operation resided in the marked bit. Convenience has its cost, however, as noted by Kwiat and Hughes (and, for that matter, by Ahn et al.): The information retrieval is inefficient, because when the Rydberg state spectrum is measured by state-selective field ionization, the atom has a good probability of collapsing to the 7s state, which effectively renders it invisible.

The experimental technique could be modified to overcome this inefficiency. We have explored algorithms that store no probability in the 7s state. Such an approach has some advantages, because nearly all of the quantum dissipation in the experiment occurs through the 7s radiative decay. The universal decoding pulse can then execute the IOM operation in the way preferred by Kwiat and Hughes, and the final state has a 100% probability of residing in the marked location, rather than a probability proportional toɛ 2. Shaped terahertz pulses can perform this universal decoding function (5), as can specially shaped optical fields that transfer population via Raman coherences with lower-lying atomic states.

Finally, Kwiat and Hughes describe a tabletop optical analog to the Ahn et al. experiment that would require neither coherent light nor interference. The difference, however, is that in the Ahn et al. experiment, each atom contains the entire data register. The experiment would not work with a heterogeneous collection of atoms—some of which, for example, are excited to state 27p and others to state 28p. In that case, the decoding pulse would have a very different effect, according to the normal rules of photoexcitation: it would excite the empty states in this heterogeneous mixture, and state-selective field ionization would detect many occupied final Rydberg states, not just the one with the marked bit.

The similarity of quantum dynamics and classical wave mechanics is because, as Schrödinger's equation guarantees, quantum evolution prior to a measurement is the same as the evolution of any classical scalar field. In the case of the Ahn et al. experiment, the quantum evolution mirrors a classical wave analysis right up until the point of measurement. The measurement breaks this, because the measurement operator must, according to quantum mechanics, return an eigenvalue of the measurement. Thus, even though the probability amplitude for a Rydberg state might be only on the order ofɛ, some atoms (actually, a fraction equivalent toɛ 2) will be found in that state, not just “partly there.” Atomic physicists are so accustomed to this natural form of quantum filtering that they often forget to emphasize it.

In sum, the number of physical operator “levers” in the Ahn experiment needed to access any desired state scales with the size of the state space, and that does not favor increasing the system to very large size. In quantum systems in which each degree of freedom is addressed separately, the operator complexity scales logarithmically with the state space, a more favorable scaling. This is, as Meyer and Kwiat and Hughes imply, an extremely important point for anyone wishing to build a large computational engine based on quantum mechanics. Although the unfavorable scaling makes the data storage method used by Ahn et al. unsuitable for very large computational problems, the experiments described in (1) nonetheless constitute progress that can serve to stimulate greater understanding and further developments in this field.

REFERENCES AND NOTES

Subjects

Navigate This Article