Equivalence checking of quantum finite-state machines

Wang, Q; Liu, J; Ying, M

Equivalence checking of quantum finite-state machines

Wang, Q Liu, J Ying, M

Permalink

Publisher:: ACADEMIC PRESS INC ELSEVIER SCIENCE
Publication Type:: Journal Article
Citation:: Journal of Computer and System Sciences, 2021, 116, pp. 1-21
Issue Date:: 2021-03-01

Closed Access

	Filename	Description	Size
	Equivalence_Checking_of_Sequential_Quantum_Circuits_Accepted version.pdf	Accepted version	934.77 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	Wang, Q
dc.contributor.author	Liu, J
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X
dc.date.accessioned	2022-05-17T04:36:14Z
dc.date.available	2022-05-17T04:36:14Z
dc.date.issued	2021-03-01
dc.identifier.citation	Journal of Computer and System Sciences, 2021, 116, pp. 1-21
dc.identifier.issn	0022-0000
dc.identifier.issn	1090-2724
dc.identifier.uri	http://hdl.handle.net/10453/157458
dc.description.abstract	In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for checking equivalence of two machines. As an application, they are used in equivalence checking of quantum circuits. Moreover, the minimisation problem is proved to be in PSPACE.
dc.language	English
dc.publisher	ACADEMIC PRESS INC ELSEVIER SCIENCE
dc.relation	http://purl.org/au-research/grants/arc/DP160101652
dc.relation	http://purl.org/au-research/grants/arc/DP180100691
dc.relation	National Natural Science Foundation of China61832015
dc.relation.ispartof	Journal of Computer and System Sciences
dc.relation.isbasedon	10.1016/j.jcss.2020.08.004
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0802 Computation Theory and Mathematics, 0805 Distributed Computing, 0806 Information Systems
dc.subject.classification	Computation Theory & Mathematics
dc.title	Equivalence checking of quantum finite-state machines
dc.type	Journal Article
utslib.citation.volume	116
utslib.for	0802 Computation Theory and Mathematics
utslib.for	0805 Distributed Computing
utslib.for	0806 Information Systems
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-05-17T04:36:13Z
pubs.publication-status	Published
pubs.volume	116

Abstract:

In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for checking equivalence of two machines. As an application, they are used in equivalence checking of quantum circuits. Moreover, the minimisation problem is proved to be in PSPACE.

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

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