<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Gate-efficient discrete simulations of continuous-time quantum query algorithms</title></titleInfo>


<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Dominic</namePart>
  <namePart type="family">W. Berry</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Richard</namePart>
  <namePart type="family">Cleve</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Sevag</namePart>
  <namePart type="family">Gharibian</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">71541</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-9992-3379</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">623</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">7</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar running time.</abstract>

<originInfo><dateIssued encoding="w3cdtf">2014</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Quantum Information &amp; Computation</title></titleInfo>
  <identifier type="arXiv">1211.4637</identifier>
<part><detail type="volume"><number>14</number></detail><detail type="issue"><number>1-2</number></detail><extent unit="pages">1-30</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<chicago>W. Berry, Dominic, Richard Cleve, and Sevag Gharibian. “Gate-Efficient Discrete Simulations of Continuous-Time Quantum Query Algorithms.” &lt;i&gt;Quantum Information &amp;#38; Computation&lt;/i&gt; 14, no. 1–2 (2014): 1–30.</chicago>
<short>D. W. Berry, R. Cleve, S. Gharibian, Quantum Information &amp;#38; Computation 14 (2014) 1–30.</short>
<ama>W. Berry D, Cleve R, Gharibian S. Gate-efficient discrete simulations of continuous-time quantum query algorithms. &lt;i&gt;Quantum Information &amp;#38; Computation&lt;/i&gt;. 2014;14(1-2):1-30.</ama>
<bibtex>@article{W. Berry_Cleve_Gharibian_2014, title={Gate-efficient discrete simulations of continuous-time quantum query algorithms}, volume={14}, number={1–2}, journal={Quantum Information &amp;#38; Computation}, author={W. Berry, Dominic and Cleve, Richard and Gharibian, Sevag}, year={2014}, pages={1–30} }</bibtex>
<apa>W. Berry, D., Cleve, R., &amp;#38; Gharibian, S. (2014). Gate-efficient discrete simulations of continuous-time quantum query algorithms. &lt;i&gt;Quantum Information &amp;#38; Computation&lt;/i&gt;, &lt;i&gt;14&lt;/i&gt;(1–2), 1–30.</apa>
<mla>W. Berry, Dominic, et al. “Gate-Efficient Discrete Simulations of Continuous-Time Quantum Query Algorithms.” &lt;i&gt;Quantum Information &amp;#38; Computation&lt;/i&gt;, vol. 14, no. 1–2, 2014, pp. 1–30.</mla>
<ieee>D. W. Berry, R. Cleve, and S. Gharibian, “Gate-efficient discrete simulations of continuous-time quantum query algorithms,” &lt;i&gt;Quantum Information &amp;#38; Computation&lt;/i&gt;, vol. 14, no. 1–2, pp. 1–30, 2014.</ieee>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>8172</recordIdentifier><recordCreationDate encoding="w3cdtf">2019-03-01T11:59:24Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2023-02-28T11:02:58Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
