Instantaneous Quantum Polytime (IQP)

• Instantaneous Quantum Polytime (IQP) is a sub-universal quantum computing model characterized by circuits with commuting diagonal gates that enable parallel, instantaneous execution.
• IQP circuits leverage structural features and conjectured average-case #P-hardness (via Ising partition functions and degree-3 polynomial gaps) to establish classical sampling intractability.
• The model’s simplicity, direct anticoncentration properties, and experimental relevance make IQP a pivotal framework in quantum complexity theory and near-term quantum advantage.

Instantaneous Quantum Polynomial Time (IQP) refers to a sub-universal model of quantum computation in which the non-Clifford gates are all diagonal in a fixed basis and commute with each other, allowing them to be applied "instantaneously." Despite its restricted structure, the IQP model is central in quantum complexity theory due to its strong conjectured classical intractability, particularly for certain average-case sampling and decision problems. IQP circuits are a focus for near-term quantum advantage proposals, serve as a touchstone for hardness-of-sampling arguments, and interface deeply with topics in statistical mechanics and coding theory.

1. Definition of IQP Circuits

An $n$-qubit IQP circuit $C$ is a depth-3 quantum circuit described by:

• Preparation: Initialize the state $|0\rangle^{\otimes n}$.
• First Hadamard Layer: Apply $H^{\otimes n}$ so $$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$.
• Diagonal Layer: Apply a sequence of $m$ commuting unitaries of the form $U_k = \exp(i\,\theta_k\,P_k)$, where $P_k$ is a Pauli-Z string $P_k = Z_{i_1}Z_{i_2}\cdots Z_{i_{w_k}}$ and $\theta_k \in \mathbb{R}$. All $C$0 commute, so the layer may be regarded as "instantaneous."
• Second Hadamard Layer: Apply $C$1.
• Measurement: Measure all qubits in the computational ($C$2) basis. The probability of observing bitstring $C$3 is $C$4.

IQP circuits are equivalently written as $C$5, where $C$6 is diagonal in the $C$7 basis. By virtue of the commutativity, the full diagonal layer can be applied in a single circuit depth.

2. Complexity-Theoretic Hardness and the Average-Case Conjectures

Sampling the output of IQP circuits is deeply linked to average-case and worst-case #P-hard problems. Two key conjectures underlie the belief in classical intractability:

• Conjecture 1 (Ising-average-case hardness): Consider random instances of the Ising partition function at complex temperature $C$8 with random edge ($C$9) and vertex ($|0\rangle^{\otimes n}$0) weights. It is #P-hard to approximate $|0\rangle^{\otimes n}$1 up to multiplicative error $|0\rangle^{\otimes n}$2 for at least $|0\rangle^{\otimes n}$3 of these random choices.
• Conjecture 2 (Degree-3 polynomial gap-average-case hardness): Let $|0\rangle^{\otimes n}$4 be a uniformly random degree-3 polynomial over $|0\rangle^{\otimes n}$5, and define the normalized gap $|0\rangle^{\otimes n}$6. It is #P-hard to approximate $|0\rangle^{\otimes n}$7 up to multiplicative error $|0\rangle^{\otimes n}$8 for at least a $|0\rangle^{\otimes n}$9 fraction of $H^{\otimes n}$0.

These conjectures each have corresponding IQP constructions whose amplitudes are directly proportional to the quantities above. Both are known to hold in the worst case; the conjecture is that the hardness extends to a constant fraction of average-case instances (Bremner et al., 2015).

3. Implications for Classical Simulation

Suppose a classical (probabilistic polynomial-time) algorithm $H^{\otimes n}$1 could sample from every $H^{\otimes n}$2-qubit IQP circuit $H^{\otimes n}$3 to $H^{\otimes n}$4-distance error at most $H^{\otimes n}$5. Then, via Stockmeyer counting and obfuscation (random gadget insertions and circuit hiding), one can show that $H^{\otimes n}$6 enables multiplicative-error approximation of amplitudes that are #P-hard to compute (as above), which would imply $H^{\otimes n}$7 and therefore cause the collapse of the Polynomial Hierarchy (PH) to its third level—widely considered implausible.

The hardness argument leverages:

• Obfuscation lemma: Randomly obfuscated IQP circuits allow approximation of individual output probabilities in $H^{\otimes n}$8 to small additive error.
• Anticoncentration (via Paley–Zygmund inequality): For both random Ising and degree-3 circuits, the output distribution is sufficiently "spread" (anticoncentrated) that large enough probabilities $H^{\otimes n}$9 occur on a constant fraction of instances.

Therefore, under either average-case conjecture, efficient (additive-error) classical simulation of generic IQP circuits would collapse PH (Bremner et al., 2015).

4. Connection to Spin-Based Boson Sampling and Avoidance of Permanent-Anticoncentration

Boson Sampling arguments rely on two conjectures about permanents of Gaussian random matrices (anticoncentration and hardness of approximate permanent computation). In contrast, IQP circuits, as "spin-based Boson Sampling," replace permanents with Ising or polynomial gap amplitudes. Crucially, anticoncentration can be established directly for IQP circuits via moment bounds and Paley–Zygmund, avoiding reliance on the permanent's anticoncentration properties.

Thus, IQP circuits avoid the "permanent-anticoncentration bottleneck" and rely on better-understood, directly-proved anticoncentration for commuting Hamiltonian amplitudes (Bremner et al., 2015).

5. IQP Model Structure and Output Distribution

Circuit Specification

Step	Description
Input	$$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$0
Gates	$$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$1 commuting $$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$2
Circuit Expansion	$$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$3
Output Measure	All qubits in $$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$4-basis, $$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$5

The commuting structure enforces that the non-Clifford part of the circuit has no timing dependencies: all diagonal gates can be implemented in parallel.

Mapping to Statistical Invariants

• Ising Partition Function: For random $$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$6 and $$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$7 gates, the $$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$8 amplitude is proportional to the Ising partition function $$|0\rangle^{\otimes n} \mapsto |+\rangle^{\otimes n}$$9 for a complete-graph random instance at complex temperature.
• Degree-3 Polynomial Gap: For circuits built from $m$0, $m$1, and $m$2 gates, the amplitude for $m$3 is the normalized gap of a random degree-3 polynomial over $m$4.

6. Complexity-Theory Hierarchy and Practical Implications

IQP demonstrates that non-universal, temporally flat (instantaneous) quantum circuits can have extreme classical sampling hardness, tightly linked to the structure of nontrivial partition and gap functions. The model is robust: PH-collapsing hardness holds for both "intermediate" and "fully random" circuit families, and the arguments generalize to related models, such as ancilla-driven IQP (ADIQP) and sparse IQP variants (Takeuchi et al., 2016, Paletta et al., 2023).

Complexity-theoretic significance includes:

• Sampling Hardness: Under either average-case conjecture, classical simulation to constant $m$5-distance is infeasible unless PH collapses (Bremner et al., 2015).
• Universality via Postselection: IQP with postselection implements PP ($m$6), yielding universality for certain decision problems (Wallman et al., 2014).
• Model-Specific Hardness: Spin-based variants avoid fragile components (such as the permanent-anticoncentration conjecture) in hardness reductions.

7. Outlook and Experimental Relevance

Commuting-Hamiltonian (IQP) circuits thus emerge as a minimal model for quantum computational advantage in the absence of temporal order, with several experimentally favorable properties:

• Simplicity of implementation.
• Hardware naturalness for parallel execution.
• Direct correspondence between output statistics and complexity-theoretic hardness indicators.
• Direct anticoncentration proofs, especially for sampling tasks based on Ising or polynomial gap problems.
• Robustness against structural loopholes that affect other sub-universal models.

In summary, IQP circuits stand at the intersection of complexity theory, sampling hardness, and statistical mechanics. Under either of two plausible average-case #P-hardness conjectures, their output distributions remain classically intractable to sample up to constant additive error, unless foundational beliefs about the structure of the Polynomial Hierarchy are overturned (Bremner et al., 2015).