Ranabir Das
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ranabir Das has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Anil Kumar
Department of Physics and Sophisticated Instruments Facility, Indian Institute of Science, Bangalore-560012, India
4 shared publications- Anil Kumar
NMR Quantum Computation and Quantum Information Group, Department of Physics and NMR Research Centre, Indian Institute of Science, Bangalore 560012, India
1 shared publication K. Rukmani
Department of Physics, Indian Institute of Science, Bangalore, India
1 shared publicationS.K. Karthick Kumar
NMR Quantum Computation and Quantum Information Group, Department of Physics and NMR Research Centre, Indian Institute of Science, Bangalore 560012, India
1 shared publicationSukhendu Chakraborty
Sophisticated Instruments Facility, Indian Institute of Science, Bangalore, India
1 shared publicationT. S. Mahesh
Department of Physics, Indian Institute of Science, Bangalore 560012, India
1 shared publication
Latest Publications
- Open Access
- 22 September 2005
- Published by Elsevier in Journal of Magnetic Resonance
- Vol. 177 (2) , 318-328
Use of non-adiabatic geometric phase for quantum computing by NMR
- 22 September 2005
- Published by Elsevier in Journal of Magnetic Resonance
- Vol. 177 (2) , 318-328
Open AccessUse of non-adiabatic geometric phase for quantum computing by NMR
- 22 October 2004
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 121 (16) , 7601-7613
Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance
Quantum information processing has been effectively demonstrated on a small number of qubits by nuclear magnetic resonance. An important subroutine in any computing is the readout of the output. ``Spectral implementation'' originally suggested by Z.L. Madi, R. Bruschweiler and R.R. Ernst, [J. Chem. Phys. 109, 10603 (1999)], provides an elegant method of readout with the use of an extra `observer' qubit. At the end of computation, detection of the observer qubit provides the output via the multiplet structure of its spectrum. In "spectral implementation" by two-dimensional experiment the observer qubit retains the memory of input state during computation, thereby providing correlated information on input and output, in the same spectrum. "Spectral implementation" of Grover's search algorithm, approximate quantum counting, a modified version of Berstein-Vazirani problem, and Hogg's algorithm is demonstrated here in three and four-qubit systems.Comment: 39 pages,11 figure
- 22 October 2004
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 121 (16) , 7601-7613
Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance
Quantum information processing has been effectively demonstrated on a small number of qubits by nuclear magnetic resonance. An important subroutine in any computing is the readout of the output. ``Spectral implementation'' originally suggested by Z.L. Madi, R. Bruschweiler and R.R. Ernst, [J. Chem. Phys. 109, 10603 (1999)], provides an elegant method of readout with the use of an extra `observer' qubit. At the end of computation, detection of the observer qubit provides the output via the multiplet structure of its spectrum. In "spectral implementation" by two-dimensional experiment the observer qubit retains the memory of input state during computation, thereby providing correlated information on input and output, in the same spectrum. "Spectral implementation" of Grover's search algorithm, approximate quantum counting, a modified version of Berstein-Vazirani problem, and Hogg's algorithm is demonstrated here in three and four-qubit systems.Comment: 39 pages,11 figure
- 29 July 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 70 (1) , 012314
Search for optimum labeling schemes in qubit systems for quantum-information processing by nuclear magnetic resonance
Optimal labeling schemes lead to efficient experimental protocols for quantum-information processing by nuclear magnetic resonance (NMR). A systematic approach to finding optimal labeling schemes for a given computation is described here. The scheme is described for both quadrupolar systems and spin- systems. Using the technique of transition selective pulses, one of the optimal labeling schemes has been applied to experimentally implement a quantum full adder in a four-qubit system by NMR.- 29 July 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 70 (1) , 012314
Search for optimum labeling schemes in qubit systems for quantum-information processing by nuclear magnetic resonance
Optimal labeling schemes lead to efficient experimental protocols for quantum-information processing by nuclear magnetic resonance (NMR). A systematic approach to finding optimal labeling schemes for a given computation is described here. The scheme is described for both quadrupolar systems and spin- systems. Using the technique of transition selective pulses, one of the optimal labeling schemes has been applied to experimentally implement a quantum full adder in a four-qubit system by NMR.- 10 September 2003
- Published by American Physical Society (APS) in Physical Review A
- Vol. 68 (3) , 032304
Use of quadrupolar nuclei for quantum-information processing by nuclear magnetic resonance: Implementation of a quantum algorithm
Physical implementation of quantum-information processing by liquid-state nuclear magnetic resonance, using weakly coupled spin- nuclei of a molecule, is well established. Nuclei with oriented in liquid-crystalline matrices is another possibility. Such systems have multiple qubits per nuclei and large quadrupolar couplings resulting in well separated lines in the spectrum. So far, creation of pseudopure states and logic gates has been demonstrated in such systems using transition selective radio-frequency pulses. In this paper we report two developments. First, we implement a quantum algorithm that needs coherent superposition of states. Second, we use evolution under quadrupolar coupling to implement multiqubit gates. We implement the Deutsch-Jozsa algorithm on a spin- (2 qubit) system. The controlled-NOT operation needed to implement this algorithm has been implemented here by evolution under the quadrupolar Hamiltonian. To the best of our knowledge, this method has been implemented for the first time in quadrupolar systems. Since the quadrupolar coupling is several orders of magnitude greater than the coupling in weakly coupled spin- nuclei, the gate time decreases, increasing the clock speed of the quantum computer.- 10 September 2003
- Published by American Physical Society (APS) in Physical Review A
- Vol. 68 (3) , 032304
Use of quadrupolar nuclei for quantum-information processing by nuclear magnetic resonance: Implementation of a quantum algorithm
Physical implementation of quantum-information processing by liquid-state nuclear magnetic resonance, using weakly coupled spin- nuclei of a molecule, is well established. Nuclei with oriented in liquid-crystalline matrices is another possibility. Such systems have multiple qubits per nuclei and large quadrupolar couplings resulting in well separated lines in the spectrum. So far, creation of pseudopure states and logic gates has been demonstrated in such systems using transition selective radio-frequency pulses. In this paper we report two developments. First, we implement a quantum algorithm that needs coherent superposition of states. Second, we use evolution under quadrupolar coupling to implement multiqubit gates. We implement the Deutsch-Jozsa algorithm on a spin- (2 qubit) system. The controlled-NOT operation needed to implement this algorithm has been implemented here by evolution under the quadrupolar Hamiltonian. To the best of our knowledge, this method has been implemented for the first time in quadrupolar systems. Since the quadrupolar coupling is several orders of magnitude greater than the coupling in weakly coupled spin- nuclei, the gate time decreases, increasing the clock speed of the quantum computer.- 20 June 2003
- Published by American Physical Society (APS) in Physical Review A
- Vol. 67 (6) , 062304
Efficient quantum-state tomography for quantum-information processing using a two-dimensional Fourier-transform technique
A method of quantum-state tomography for quantum-information processing is described. The method is based on the use of the Fourier-transform technique and involves detection of all the diagonal elements of the density matrix in a one-dimensional experiment and all the off-diagonal elements by a two-dimensional experiment. The method is efficient for a large number of qubits The proposed method is outlined using a two-qubit system and demonstrated using simulations by tomographing arbitrary complex density matrices of two- and four-qubit systems.- 20 June 2003
- Published by American Physical Society (APS) in Physical Review A
- Vol. 67 (6) , 062304
Efficient quantum-state tomography for quantum-information processing using a two-dimensional Fourier-transform technique
A method of quantum-state tomography for quantum-information processing is described. The method is based on the use of the Fourier-transform technique and involves detection of all the diagonal elements of the density matrix in a one-dimensional experiment and all the off-diagonal elements by a two-dimensional experiment. The method is efficient for a large number of qubits The proposed method is outlined using a two-qubit system and demonstrated using simulations by tomographing arbitrary complex density matrices of two- and four-qubit systems.