
Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/2775
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dogra, S. | - |
dc.contributor.author | Arvind | - |
dc.contributor.author | Dorai, K. | - |
dc.date.accessioned | 2020-12-07T11:10:24Z | - |
dc.date.available | 2020-12-07T11:10:24Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Physics Letters, Section A: General, Atomic and Solid State Physics, 378(46), pp.3452-3456. | en_US |
dc.identifier.other | https://doi.org/10.1016/j.physleta.2014.10.003 | - |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S0375960114009955?via%3Dihub | - |
dc.identifier.uri | http://hdl.handle.net/123456789/2775 | - |
dc.description.abstract | 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 believed that computational speedup requires the presence of entanglement and thus cannot be achieved by a single qubit. On the other hand, a qutrit is qualitatively more quantum than a qubit because of the existence of quantum contextuality and a single qutrit can be used for computing. We use the deuterium nucleus oriented in a liquid crystal as the experimental qutrit. This is the first experimental exploitation of a single qutrit to carry out a computational task. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier B.V. | en_US |
dc.subject | NMR quantum computing | en_US |
dc.subject | Qudits | en_US |
dc.subject | Qutrit computing | en_US |
dc.subject | Parity checking algorithm | en_US |
dc.subject | Quantum contextuality | en_US |
dc.title | Determining the parity of a permutation using an experimental NMR qutrit | en_US |
dc.type | Article | en_US |
Appears in Collections: | Research Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
need to add pdf....odt | 8.12 kB | OpenDocument Text | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.