(Un)decidable problems about reachability of quantum systems

Li, Y; Ying, M

(Un)decidable problems about reachability of quantum systems

Li, Y Ying, M

Permalink

Publisher:: Springer
Publication Type:: Conference Proceeding
Citation:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8704 LNCS, pp. 482-496
Issue Date:: 2014-01-01

Recently Added

	Filename	Description	Size
	1401.6249v1.pdf	Preprint	270.95 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is new to OPUS and is not currently available.

Full metadata record

Field	Value	Language
dc.contributor.author	Li, Y
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X
dc.date.accessioned	2023-03-14T01:45:29Z
dc.date.available	2023-03-14T01:45:29Z
dc.date.issued	2014-01-01
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8704 LNCS, pp. 482-496
dc.identifier.isbn	9783662445839
dc.identifier.issn	0302-9743
dc.identifier.issn	1611-3349
dc.identifier.uri	http://hdl.handle.net/10453/167293
dc.description.abstract	We study the reachability problem of a quantum system modeled by a quantum automaton, namely, a set of processes each of which is formalized as a quantum unitary transformation. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state Hilbert space of the quantum system. Four different reachability properties are considered: eventually reachable, globally reachable, ultimately forever reachable, and infinitely often reachable. The main result of this paper is that all of the four reachability properties are undecidable in general; however, the last three become decidable if the reachable sets are boolean combinations without negation. © 2014 Springer-Verlag.
dc.language	en
dc.publisher	Springer
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.relation.ispartof	International Conference on Concurrency Theory
dc.relation.ispartofseries	Lecture Notes in Computer Science
dc.relation.isbasedon	10.1007/978-3-662-44584-6_33
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.subject.classification	Artificial Intelligence & Image Processing
dc.title	(Un)decidable problems about reachability of quantum systems
dc.type	Conference Proceeding
utslib.citation.volume	8704 LNCS
utslib.location.activity	Rome, Italy
utslib.for	0801 Artificial Intelligence and Image Processing
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	recently_added	*
pubs.consider-herdc	false
dc.date.updated	2023-03-14T01:45:28Z
pubs.publication-status	Published
pubs.volume	8704 LNCS

Abstract:

We study the reachability problem of a quantum system modeled by a quantum automaton, namely, a set of processes each of which is formalized as a quantum unitary transformation. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state Hilbert space of the quantum system. Four different reachability properties are considered: eventually reachable, globally reachable, ultimately forever reachable, and infinitely often reachable. The main result of this paper is that all of the four reachability properties are undecidable in general; however, the last three become decidable if the reachable sets are boolean combinations without negation. © 2014 Springer-Verlag.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/167293