Geometric and holonomic quantum computation utilizes intrinsic geometric properties of
quantum-mechanical state spaces to realize quantum logic gates. Since both geometric …

Quantum computers [1–4] are explicitly quantum mechanical systems that use phenomena
such as superposition and entanglement to perform computational tasks more efficiently …

We present the NMR implementation of a recently proposed quantum algorithm to find the
parity of a permutation. In the usual qubit model of quantum computation, it is widely …

The Aharonov–Anandan phase is a contribution to the phase acquired by the cyclic
evolution of a quantum state, which depends only on the geometric properties of its …

We report a study of the Majorana geometrical representation of a qutrit, where a pair of
points on a unit sphere represents its quantum states. A canonical form for qutrit states is …

Cyclic quantum evolution is accompanied by a systematic change in the phase of the initial
state vector. This change only depends upon the path traced out by the system itself. Such …

Quantum processors based on NMR architectures, which use nuclear spins as qubits and
radio frequency pulses to implement unitary quantum gates, came into existence nearly two …

An approach for emulating quantum circuits using conventional analog hardware is
presented based on the intuitive similarity between fuzzy logic and quantum superposition …

The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and
a qudit-specific implementation of the QFT is hence an important step toward the realization …

We study quantum information properties of a seven-level system realized by a particle in a
onedimensional square-well trap and discuss the features of encodings of seven-level …