<?xml version="1.0"?>

<!DOCTYPE owl [
	<!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
	<!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
	<!ENTITY owl "http://www.w3.org/2002/07/owl#">
	<!ENTITY cc "http://web.resource.org/cc/#">
	<!ENTITY project "http://ebiquity.umbc.edu/ontology/project.owl#">
	<!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
	<!ENTITY pub "http://ebiquity.umbc.edu/ontology/publication.owl#">
	<!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">
]>

<!--

This ontology document is licensed under the Creative Commons
Attribution License. To view a copy of this license, visit
http://creativecommons.org/licenses/by/2.0/ or send a letter to
Creative Commons, 559 Nathan Abbott Way, Stanford, California
94305, USA.

-->

<rdf:RDF 
		xmlns:rdf = "&rdf;"
		xmlns:rdfs = "&rdfs;"
		xmlns:xsd = "&xsd;"
		xmlns:owl = "&owl;"
		xmlns:cc = "&cc;"
		xmlns:project = "&project;"
		xmlns:person = "&person;"
		xmlns:pub = "&pub;"
		xmlns:assert = "&assert;">
	<pub:Article rdf:about="http://ebiquity.umbc.edu/paper/html/id/845/Quantum-Annealing-Based-Binary-Compressive-Sensing-with-Matrix-Uncertainty">
		<rdfs:label><![CDATA[Quantum Annealing Based Binary Compressive Sensing  with Matrix Uncertainty]]></rdfs:label>
		<pub:title><![CDATA[Quantum Annealing Based Binary Compressive Sensing  with Matrix Uncertainty]]></pub:title>
		<pub:publishedOn rdf:datatype="&xsd;dateTime">2019-01-01T00:00:00-05:00</pub:publishedOn>
		<pub:abstract><![CDATA[Compressive sensing is a novel approach that linearly samples sparse or compressible signals at a rate much below the Nyquist-Shannon sampling rate and outperforms traditional signal processing techniques in acquiring and reconstructing such signals. Compressive sensing with matrix uncertainty is an extension of the standard compressive sensing problem that appears in various applications, including but not limited to cognitive radio sensing, calibration of the antenna, and deconvolution. The original problem of compressive sensing is NP-hard, so the traditional techniques, such as convex and nonconvex relaxations and greedy algorithms, apply stringent constraints on the measurement matrix to indirectly handle this problem in the realm of classical computing. We propose well-posed approaches for both binary compressive sensing and binary compressive sensing with matrix uncertainty problems that are tractable by quantum annealers. Our approach formulates an Ising model whose ground state represents a sparse solution for the binary compressive sensing problem and then employs an alternating minimization scheme to tackle the binary compressive sensing with matrix uncertainty problem. This setting only requires the solution uniqueness of the considered problem to have a successful recovery process, and therefore the required conditions on the measurement matrix are notably looser. As a proof of concept, we can demonstrate the applicability of the proposed approach on the D-Wave quantum annealers; however, we can adapt our method to employ other modern computing phenomena–like adiabatic quantum computers (in general), CMOS annealers, optical parametric oscillators, and neuromorphic computing.]]></pub:abstract>
		<pub:note><![CDATA[DOI: <a href="https://doi.org/10.48550/arXiv.1901.00088">10.48550/arXiv.1901.00088</a>
<br/>
<img src="https://i.imgur.com/8SvZkFE.png" style='height: 50%; width: 50%; object-fit: contain; display: block; margin-left: auto; margin-right: auto;'>]]></pub:note>
		<pub:counter>1115</pub:counter>
		<pub:tag><![CDATA[annealing]]></pub:tag>
		<pub:tag><![CDATA[compressive sensing]]></pub:tag>
		<pub:tag><![CDATA[d-wave]]></pub:tag>
		<pub:tag><![CDATA[ising model]]></pub:tag>
		<pub:tag><![CDATA[quantum]]></pub:tag>
		<pub:tag><![CDATA[quantum annealing]]></pub:tag>
		<pub:tag><![CDATA[signal processing]]></pub:tag>
		<pub:booktitle><![CDATA[arXiv:1901.00088 [cs.IT]]]></pub:booktitle>
		<pub:publisher><![CDATA[arXiv]]></pub:publisher>
		<pub:author>
			<rdf:List>
				<rdf:first>
					<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Tim/Finin"><person:name><![CDATA[Tim Finin]]></person:name><rdfs:label><![CDATA[Tim Finin]]></rdfs:label></person:Person>
				</rdf:first>
				<rdf:rest>					<rdf:List>
						<rdf:first>
							<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Milton/Halem"><person:name><![CDATA[Milton Halem]]></person:name><rdfs:label><![CDATA[Milton Halem]]></rdfs:label></person:Person>
						</rdf:first>
						<rdf:rest>							<rdf:List>
								<rdf:first>
									<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Ramin/Ayanzadeh"><person:name><![CDATA[Ramin Ayanzadeh]]></person:name><rdfs:label><![CDATA[Ramin Ayanzadeh]]></rdfs:label></person:Person>
								</rdf:first>
								<rdf:rest>									<rdf:List>
										<rdf:first>
											<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Seyedahmad/Mousavi"><person:name><![CDATA[Seyedahmad Mousavi]]></person:name><rdfs:label><![CDATA[Seyedahmad Mousavi]]></rdfs:label></person:Person>
										</rdf:first>
										<rdf:rest rdf:resource="&rdf;nil" />
									</rdf:List>
								</rdf:rest>
							</rdf:List>
						</rdf:rest>
					</rdf:List>
				</rdf:rest>
			</rdf:List>
		</pub:author>
		<pub:firstAuthor>
<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Tim/Finin"><person:name><![CDATA[Tim Finin]]></person:name><rdfs:label><![CDATA[Tim Finin]]></rdfs:label></person:Person>
		</pub:firstAuthor>
		<pub:softCopy><pub:SoftCopy>
			<pub:softCopyFormat><![CDATA[PDF Document]]></pub:softCopyFormat>
			<pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/909.pdf]]></pub:softCopyURI>
			<pub:softCopySize>434792</pub:softCopySize>
			</pub:SoftCopy>
			</pub:softCopy>
	</pub:Article>

<rdf:Description rdf:about="">
	<cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
</rdf:Description>

</rdf:RDF>
