CRM: Centro De Giorgi
logo sns
IQIS2009: Italian Quantum Information Science Conference 2009

Random Quantum Satisfiability

speaker: Antonello Scardicchio (Abdus Salam ICTP)

abstract: Quantum SAT is a natural generalization of k-Satisfiability and has been proven to be QMA-complete, hence among the most difficult problems for a quantum computer. We introduce a natural measure for defining a random ensemble and find a SAT and UNSAT phases separated by a phase transition. The nature and the precise location of the transition are under current investigation.


timetable:
Fri 6 Nov, 9:30 - 10:00, Aula Dini
<< Go back