A proof system for disjoint parallel quantum programs

Ying, M; Zhou, L; Li, Y; Feng, Y

A proof system for disjoint parallel quantum programs

Ying, M

Zhou, L Li, Y Feng, Y

Permalink

Publisher:: ELSEVIER
Publication Type:: Journal Article
Citation:: Theoretical Computer Science, 2022, 897, pp. 164-184
Issue Date:: 2022-01-02

Closed Access

	Filename	Description	Size
	A-proof-system-for-disjoint-parallel-quantum-programs-1-s2.0-S0304397521006484-main.pdf	Published version	448.94 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X
dc.contributor.author	Zhou, L
dc.contributor.author	Li, Y
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896
dc.date.accessioned	2022-02-18T02:46:47Z
dc.date.available	2022-02-18T02:46:47Z
dc.date.issued	2022-01-02
dc.identifier.citation	Theoretical Computer Science, 2022, 897, pp. 164-184
dc.identifier.issn	0304-3975
dc.identifier.issn	1879-2294
dc.identifier.uri	http://hdl.handle.net/10453/154679
dc.description.abstract	In this paper, we define the operational and denotational semantics of a special class of parallel quantum programs, namely disjoint parallel quantum programs. Based on them, a proof system for reasoning about disjoint parallel quantum programs is developed, which is (relatively) complete even when entanglement between different processes appears in the preconditions and postconditions.
dc.language	English
dc.publisher	ELSEVIER
dc.relation.ispartof	Theoretical Computer Science
dc.relation.isbasedon	10.1016/j.tcs.2021.10.025
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	01 Mathematical Sciences, 08 Information and Computing Sciences
dc.subject.classification	Computation Theory & Mathematics
dc.title	A proof system for disjoint parallel quantum programs
dc.type	Journal Article
utslib.citation.volume	897
utslib.for	01 Mathematical Sciences
utslib.for	08 Information and Computing Sciences
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	closed_access	*
dc.date.updated	2022-02-18T02:46:45Z
pubs.publication-status	Published
pubs.volume	897

Abstract:

In this paper, we define the operational and denotational semantics of a special class of parallel quantum programs, namely disjoint parallel quantum programs. Based on them, a proof system for reasoning about disjoint parallel quantum programs is developed, which is (relatively) complete even when entanglement between different processes appears in the preconditions and postconditions.

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

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