2026-09-18T21:47:44Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1392682022-01-15T03:37:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Harrow, Aram
Joshi, Malvika
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2022-01-14T15:00:31Z
2022-01-14T15:00:31Z
2021-06
2021-06-17T20:13:25.553Z
https://hdl.handle.net/1721.1/139268
We examine the IQP protocol for verifying quantumness presented by Shepherd and Bremner in 2009 [SB09]. In this protocol, the classical verifier sends a prover an IQP circuit and expects back samples from its output distribution as evidence that the prover has quantum capabilities. To test that the samples indeed came from the circuit, the verifier checks that they are consistent with the bias of the output distribution of the circuit in the direction of a secret string s. This bias is given by (1 + 2−𝑔/2 )/2 where 𝑔 is a parameter associated with the Hamiltonian 𝐻 and s [YC20]. We study this parameter and give a strategy for forging samples to fool the verifier into believing that a classical prover is quantum, with a constant probability dependent on 𝑔. We also give a natural method for constructing random circuits with a particular value of 𝑔, either 𝑔 = 0 or 𝑔 = 1. We use the classical forging strategy, along with the construction methods to show that when 𝑔 is small, an adversary can extract s from just 𝐻 and forge samples to fool the verifier with high probability. We give heuristic arguments for the validity of these attacks and demonstrate their success numerically.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Pretending to be Quantum: A study of IQP-based tests of quantumness
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="72dd361c-71c3-4edb-b6b0-df6401304576">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Pretending to be Quantum: A study of IQP-based tests of quantumness</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2021-06</PublicationDate>
<Authors>
<Author>
<DisplayName>Joshi, Malvika</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>We examine the IQP protocol for verifying quantumness presented by Shepherd and Bremner in 2009 [SB09]. In this protocol, the classical verifier sends a prover an IQP circuit and expects back samples from its output distribution as evidence that the prover has quantum capabilities. To test that the samples indeed came from the circuit, the verifier checks that they are consistent with the bias of the output distribution of the circuit in the direction of a secret string s. This bias is given by (1 + 2−𝑔/2 )/2 where 𝑔 is a parameter associated with the Hamiltonian 𝐻 and s [YC20]. We study this parameter and give a strategy for forging samples to fool the verifier into believing that a classical prover is quantum, with a constant probability dependent on 𝑔. We also give a natural method for constructing random circuits with a particular value of 𝑔, either 𝑔 = 0 or 𝑔 = 1. We use the classical forging strategy, along with the construction methods to show that when 𝑔 is small, an adversary can extract s from just 𝐻 and forge samples to fool the verifier with high probability. We give heuristic arguments for the validity of these attacks and demonstrate their success numerically.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>