Towards Efficient Reasoning of Quantum Programs

Yu, N

Towards Efficient Reasoning of Quantum Programs

Yu, N

Permalink

Publisher:: Springer Nature
Publication Type:: Conference Proceeding
Citation:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2022, 13790 LNCS, pp. 10-15
Issue Date:: 2022-01-01

Closed Access

	Filename	Description	Size
	978-3-031-22308-2_2.pdf	Published version	172.32 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	Yu, N https://orcid.org/0000-0003-1188-3032
dc.date.accessioned	2023-08-06T22:20:35Z
dc.date.available	2023-08-06T22:20:35Z
dc.date.issued	2022-01-01
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2022, 13790 LNCS, pp. 10-15
dc.identifier.isbn	9783031223075
dc.identifier.issn	0302-9743
dc.identifier.issn	1611-3349
dc.identifier.uri	http://hdl.handle.net/10453/171722
dc.description.abstract	Qubit is the basic unit of information in quantum computing. It takes exponential time in the number of qubits to simulate the evolution of general quantum programs. This fact makes simulation infeasible beyond 50 qubits on current supercomputers. This observation motivates us to use static techniques to understand larger programs. We will briefly overview our recent efforts to develop static methods for quantum programming.
dc.language	en
dc.publisher	Springer Nature
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.relation.ispartofseries	Lecture Notes in Computer Science
dc.relation.isbasedon	10.1007/978-3-031-22308-2_2
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject.classification	Artificial Intelligence & Image Processing
dc.subject.classification	46 Information and computing sciences
dc.title	Towards Efficient Reasoning of Quantum Programs
dc.type	Conference Proceeding
utslib.citation.volume	13790 LNCS
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	2023-08-06T22:20:34Z
pubs.publication-status	Published
pubs.volume	13790 LNCS

Abstract:

Qubit is the basic unit of information in quantum computing. It takes exponential time in the number of qubits to simulate the evolution of general quantum programs. This fact makes simulation infeasible beyond 50 qubits on current supercomputers. This observation motivates us to use static techniques to understand larger programs. We will briefly overview our recent efforts to develop static methods for quantum programming.

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

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