Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and S...

Full description

Saved in:

Bibliographic Details
Published in:	Quantum information processing Vol. 16; no. 9; pp. 1 - 14
Main Authors:	Johansson, Niklas, Larsson, Jan-Åke
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2017 Springer Nature B.V
Subjects:	Algorithms Computer simulation Data Structures and Information Theory Mathematical Physics Physics Physics and Astronomy Quantum computers Quantum Computing Quantum Information Technology Quantum phenomena Quantum Physics Quantum theory Spintronics Deutsch-Jozsa Problem Quantum Oracle Classical Probabilistic Turing Machine Quantum Algorithms Spot Phase
ISSN:	1570-0755, 1573-1332, 1573-1332
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!