Adiabatic graph-state quantum computation (Q3387146)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Adiabatic graph-state quantum computation	scientific article

Statements

scholarly article

0 references

Adiabatic graph-state quantum computation (English)

0 references

New Journal of Physics

0 references

publication date

12 January 2021

0 references

full work available at URL

https://arxiv.org/abs/1309.1443

0 references

MaRDI profile type

MaRDI publication profile

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

Adiabatic Quantum State Generation

0 references

Holonomic quantum computation

0 references

0 references

Universal Blind Quantum Computation

0 references

Computational Depth Complexity of Measurement-Based Quantum Computation

0 references

Quantal phase factors accompanying adiabatic changes

0 references

Berry phase effects on electronic properties

0 references

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

0 references

Geometric Phase in Open Systems

0 references

The quantum adiabatic optimization algorithm and local minima

0 references

Finding Optimal Flows Efficiently

0 references

0 references

Parity, circuits, and the polynomial-time hierarchy

0 references

Identifiers

zbMATH Open document ID

0 references

10.1088/1367-2630/16/11/113070

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3387146

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3387146&oldid=36644168"