DOI: 10.1098/rsta.1998.0248. Quantum algorithms: entanglement

Quantum algorithms: entanglement–enhanced information processing

10.1098/rsta.1998.0248

Crossref journal-article

The Royal Society

Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences (175)

Bibliography

Ekert, A., & Jozsa, R. (1998). Quantum algorithms: entanglementâenhanced information processing. Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 356(1743), 1769â1782.

Authors 2

Artur Ekert (first)
Richard Jozsa (additional)

References 35 Referenced 148

Bernstein E. & Vazirani U. 1993 Proc. 25th A. Symp. on the Theory of Computing pp. 11-20. New York: ACM. (10.1145/167088.167097)
Brassard G. & Hoyer P. 1997 An exact polynomial-time algorithm for Simon’s problem. quantph/9704027.
10.1098/rspa.1998.0164
10.1090/S0025-5718-1965-0178586-1
Cover T. & Thomas J. 1991 Elements of information theory. New York: Wiley. (10.1002/0471200611)
10.1098/rspa.1985.0070
10.1098/rspa.1992.0167
10.1103/RevModPhys.68.733
10.1007/BF02650179
Fraleigh J. B. 1994 A first course in abstract algebra 5th edn. Reading MA: Addison-Wesley.
10.1103/PhysRevA.53.2038
Fulton W. & Harris J. 1991 Representation theory: a first course ch. 1 2. New York: Springer.
Gauss C. F. 1886 Theoria interpolationis methodo nova tractata. Gauss’ collected works vol. 3.
Grover L. 1996 Proc. 28th A. Symp. on the Theory of Computing pp. 212-219. New York: ACM. (10.1145/237814.237866)
{'key': 'p_15', 'first-page': '177', 'volume': '9', 'author': 'Holevo A. S.', 'year': '1973', 'journal-title': 'Probl. Inf. Transm.'} / Probl. Inf. Transm. by Holevo A. S. (1973)
Jozsa R. 1998a Entanglement and quantum computation. In The geometric universe (ed. S. Huggett L. Mason K. P. Tod S. T. Tsou & N. M. J. Woodhouse) pp. 369-379. Oxford University Press. (10.1093/oso/9780198500599.003.0027)
10.1098/rspa.1998.0163
Kitaev A. 1995 Quantum measurements and the Abelian stabiliser problem. quant-ph/9511026.
{'key': 'p_19', 'first-page': '183', 'article-title': 'Generalised FFTs: a survey of some recent results. In Proc. DIMACS Workshop on Groups and Computation (ed. L. Finkelstein & W. Kantor). DIMACS Series in Disc', 'volume': '28', 'author': 'Maslen D. K.', 'year': '1995', 'journal-title': 'Math. and Comp. Sci.'} / Math. and Comp. Sci. / Generalised FFTs: a survey of some recent results. In Proc. DIMACS Workshop on Groups and Computation (ed. L. Finkelstein & W. Kantor). DIMACS Series in Disc by Maslen D. K. (1995)
Papadimitriou C. H. 1994 Computational complexity Reading MA: Addison-Wesley.
Shor P. 1994 Proc. 35th A. Symp. on the Foundations of Computer Science p. 124. Los Alamitos CA: IEEE Computer Society.
Simon D. 1994 Proc. 35th A. Symp. on the Foundations of Computer Science p. 116. Los Alamitos CA: IEEE Computer Society. Discussion
Th. Beth (University of Karlsruhe Germany). There are more types of generalized
Fourier transforms on non-Abelian groups than those mentioned by Professor Jozsa
for example affine groups going hand in hand with modern wavelet theory. Taking the
point of view that quantum computers are most likely to be high-power correlation
machines the generalized FT algorithms will play an important role in future. The fast algorithms for this type of transform were published 14 years ago (Beth
1984).
R. Jozsa. Some quantum wavelet transforms have been considered by Hoyer (1997)
and it would certainly be interesting to further consider their applicability. However
their quantum implementation appears to involve no new physical effects beyond
those that provide the speed-up in the basic quantum Abelian Fourier transform as
described in the paper.
Beth Th. 1984 Uefahren der schnellen Fourier Transformation. Stuttgart: B. G. Teubner.
Hoyer P. 1997 Efficient quantum algorithms. quant-ph/9702028.

Dates

Type	When
Created	23 years, 1 month ago (July 26, 2002, 7:57 p.m.)
Deposited	8 months, 2 weeks ago (Dec. 8, 2024, 8:06 a.m.)
Indexed	5 days, 20 hours ago (Aug. 21, 2025, 1:28 p.m.)
Issued	27 years ago (Aug. 15, 1998)
Published	27 years ago (Aug. 15, 1998)
Published Online	27 years ago (Aug. 15, 1998)
Published Print	27 years ago (Aug. 15, 1998)

Funders 0

None

BibTeX

@article{Ekert_1998, title={Quantum algorithms: entanglement–enhanced information processing}, volume={356}, ISSN={1471-2962}, url={http://dx.doi.org/10.1098/rsta.1998.0248}, DOI={10.1098/rsta.1998.0248}, number={1743}, journal={Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences}, publisher={The Royal Society}, author={Ekert, Artur and Jozsa, Richard}, editor={Ekert, A. and Jozsa, R. and Penrose, R.}, year={1998}, month=aug, pages={1769–1782} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        8,
        21
      ]
    ],
    "date-time": "2025-08-21T17:28:09Z",
    "timestamp": 1755797289830,
    "version": "3.30.1"
  },
  "reference-count": 35,
  "publisher": "The Royal Society",
  "issue": "1743",
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1998,
        8,
        15
      ]
    ]
  },
  "DOI": "10.1098/rsta.1998.0248",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2002,
        7,
        26
      ]
    ],
    "date-time": "2002-07-26T23:57:35Z",
    "timestamp": 1027727855000
  },
  "page": "1769-1782",
  "source": "Crossref",
  "is-referenced-by-count": 148,
  "title": "Quantum algorithms: entanglement\u2013enhanced information processing",
  "prefix": "10.1098",
  "volume": "356",
  "author": [
    {
      "given": "Artur",
      "family": "Ekert",
      "sequence": "first",
      "affiliation": [
        {
          "name": "Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU, UK"
        }
      ]
    },
    {
      "given": "Richard",
      "family": "Jozsa",
      "sequence": "additional",
      "affiliation": [
        {
          "name": "School of Mathematics and Statistics, University of Plymouth, Plymouth, Devon PL4 8AA, UK"
        }
      ]
    }
  ],
  "member": "175",
  "published-online": {
    "date-parts": [
      [
        1998,
        8,
        15
      ]
    ]
  },
  "reference": [
    {
      "key": "p_1",
      "doi-asserted-by": "crossref",
      "unstructured": "Bernstein E. & Vazirani U. 1993 Proc. 25th A. Symp. on the Theory of Computing pp. 11-20. New York: ACM.",
      "DOI": "10.1145/167088.167097"
    },
    {
      "key": "p_2",
      "unstructured": "Brassard G. & Hoyer P. 1997 An exact polynomial-time algorithm for Simon\u2019s problem. quantph/9704027."
    },
    {
      "key": "p_3",
      "doi-asserted-by": "publisher",
      "DOI": "10.1098/rspa.1998.0164"
    },
    {
      "key": "p_4",
      "doi-asserted-by": "publisher",
      "DOI": "10.1090/S0025-5718-1965-0178586-1"
    },
    {
      "key": "p_5",
      "doi-asserted-by": "crossref",
      "unstructured": "Cover T. & Thomas J. 1991 Elements of information theory. New York: Wiley.",
      "DOI": "10.1002/0471200611"
    },
    {
      "key": "p_6",
      "doi-asserted-by": "publisher",
      "DOI": "10.1098/rspa.1985.0070"
    },
    {
      "key": "p_7",
      "doi-asserted-by": "publisher",
      "DOI": "10.1098/rspa.1992.0167"
    },
    {
      "key": "p_8",
      "doi-asserted-by": "publisher",
      "DOI": "10.1103/RevModPhys.68.733"
    },
    {
      "key": "p_9",
      "doi-asserted-by": "publisher",
      "DOI": "10.1007/BF02650179"
    },
    {
      "key": "p_10",
      "unstructured": "Fraleigh J. B. 1994 A first course in abstract algebra 5th edn. Reading MA: Addison-Wesley."
    },
    {
      "key": "p_11",
      "doi-asserted-by": "publisher",
      "DOI": "10.1103/PhysRevA.53.2038"
    },
    {
      "key": "p_12",
      "unstructured": "Fulton W. & Harris J. 1991 Representation theory: a first course ch. 1 2. New York: Springer."
    },
    {
      "key": "p_13",
      "unstructured": "Gauss C. F. 1886 Theoria interpolationis methodo nova tractata. Gauss\u2019 collected works vol. 3."
    },
    {
      "key": "p_14",
      "doi-asserted-by": "crossref",
      "unstructured": "Grover L. 1996 Proc. 28th A. Symp. on the Theory of Computing pp. 212-219. New York: ACM.",
      "DOI": "10.1145/237814.237866"
    },
    {
      "key": "p_15",
      "first-page": "177",
      "volume": "9",
      "author": "Holevo A. S.",
      "year": "1973",
      "journal-title": "Probl. Inf. Transm."
    },
    {
      "key": "p_16",
      "doi-asserted-by": "crossref",
      "unstructured": "Jozsa R. 1998a Entanglement and quantum computation. In The geometric universe (ed. S. Huggett L. Mason K. P. Tod S. T. Tsou & N. M. J. Woodhouse) pp. 369-379. Oxford University Press.",
      "DOI": "10.1093/oso/9780198500599.003.0027"
    },
    {
      "key": "p_17",
      "doi-asserted-by": "publisher",
      "DOI": "10.1098/rspa.1998.0163"
    },
    {
      "key": "p_18",
      "unstructured": "Kitaev A. 1995 Quantum measurements and the Abelian stabiliser problem. quant-ph/9511026."
    },
    {
      "key": "p_19",
      "first-page": "183",
      "article-title": "Generalised FFTs: a survey of some recent results. In Proc. DIMACS Workshop on Groups and Computation (ed. L. Finkelstein & W. Kantor). DIMACS Series in Disc",
      "volume": "28",
      "author": "Maslen D. K.",
      "year": "1995",
      "journal-title": "Math. and Comp. Sci."
    },
    {
      "key": "p_20",
      "unstructured": "Papadimitriou C. H. 1994 Computational complexity Reading MA: Addison-Wesley."
    },
    {
      "key": "p_21",
      "unstructured": "Shor P. 1994 Proc. 35th A. Symp. on the Foundations of Computer Science p. 124. Los Alamitos CA: IEEE Computer Society."
    },
    {
      "key": "p_22",
      "unstructured": "Simon D. 1994 Proc. 35th A. Symp. on the Foundations of Computer Science p. 116. Los Alamitos CA: IEEE Computer Society. Discussion"
    },
    {
      "key": "p_23",
      "unstructured": "Th. Beth (University of Karlsruhe Germany). There are more types of generalized"
    },
    {
      "key": "p_24",
      "unstructured": "Fourier transforms on non-Abelian groups than those mentioned by Professor Jozsa"
    },
    {
      "key": "p_25",
      "unstructured": "for example affine groups going hand in hand with modern wavelet theory. Taking the"
    },
    {
      "key": "p_26",
      "unstructured": "point of view that quantum computers are most likely to be high-power correlation"
    },
    {
      "key": "p_27",
      "unstructured": "machines the generalized FT algorithms will play an important role in future. The fast algorithms for this type of transform were published 14 years ago (Beth"
    },
    {
      "key": "p_28",
      "unstructured": "1984)."
    },
    {
      "key": "p_29",
      "unstructured": "R. Jozsa. Some quantum wavelet transforms have been considered by Hoyer (1997)"
    },
    {
      "key": "p_30",
      "unstructured": "and it would certainly be interesting to further consider their applicability. However"
    },
    {
      "key": "p_31",
      "unstructured": "their quantum implementation appears to involve no new physical effects beyond"
    },
    {
      "key": "p_32",
      "unstructured": "those that provide the speed-up in the basic quantum Abelian Fourier transform as"
    },
    {
      "key": "p_33",
      "unstructured": "described in the paper."
    },
    {
      "key": "p_34",
      "unstructured": "Beth Th. 1984 Uefahren der schnellen Fourier Transformation. Stuttgart: B. G. Teubner."
    },
    {
      "key": "p_35",
      "unstructured": "Hoyer P. 1997 Efficient quantum algorithms. quant-ph/9702028."
    }
  ],
  "container-title": "Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://royalsocietypublishing.org/doi/pdf/10.1098/rsta.1998.0248",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2024,
        12,
        8
      ]
    ],
    "date-time": "2024-12-08T13:06:41Z",
    "timestamp": 1733663201000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://royalsocietypublishing.org/doi/10.1098/rsta.1998.0248"
    }
  },
  "subtitle": [],
  "editor": [
    {
      "given": "A.",
      "family": "Ekert",
      "sequence": "additional",
      "affiliation": []
    },
    {
      "given": "R.",
      "family": "Jozsa",
      "sequence": "additional",
      "affiliation": []
    },
    {
      "given": "R.",
      "family": "Penrose",
      "sequence": "additional",
      "affiliation": []
    }
  ],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1998,
        8,
        15
      ]
    ]
  },
  "references-count": 35,
  "journal-issue": {
    "issue": "1743",
    "published-online": {
      "date-parts": [
        [
          1998,
          8,
          15
        ]
      ]
    },
    "published-print": {
      "date-parts": [
        [
          1998,
          8,
          15
        ]
      ]
    }
  },
  "alternative-id": [
    "10.1098/rsta.1998.0248"
  ],
  "URL": "http://dx.doi.org/10.1098/rsta.1998.0248",
  "relation": {},
  "ISSN": [
    "1364-503X",
    "1471-2962"
  ],
  "subject": [],
  "container-title-short": "Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences",
  "published": {
    "date-parts": [
      [
        1998,
        8,
        15
      ]
    ]
  }
}