IQP computations with intermediate measurements

• URL: http://arxiv.org/abs/2408.10093v3
• Date: Thu, 10 Jul 2025 16:26:52 GMT
• Title: IQP computations with intermediate measurements
• Authors: Richard Jozsa, Soumik Ghosh, Sergii Strelchuk,
• Abstract summary: We consider the computational model of IQP circuits (in which all computational steps are $X$ basis diagonal gates)<n>We show that if we allow non-adaptive or adaptive $X$ basis measurements, or allow non-adaptive $Z$ basis measurements, the computational power remains the same as that of the original IQP model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the computational model of IQP circuits (in which all computational steps are $X$ basis diagonal gates), supplemented by intermediate $X$ or $Z$ basis measurements. We show that if we allow non-adaptive or adaptive $X$ basis measurements, or allow non-adaptive $Z$ basis measurements, then the computational power remains the same as that of the original IQP model; and with adaptive $Z$ basis measurements the model becomes quantum universal. Furthermore we show that the computational model having circuits of only $CZ$ gates and adaptive $X$ basis measurements, with input states that are tensor products of 1-qubit states from the set $\{ |+\rangle, |1\rangle,\frac{1}{\sqrt{2}}(|0\rangle+i|1\rangle), \frac{1}{\sqrt{2}}(|0\rangle+e^{i\pi/4}|1\rangle) \} $, is quantum universal. In contrast to the relation of IQP to PH collapse, all our results here are manifestly stable under small additive implementational errors.

Related papers

• Expressivity of deterministic quantum computation with one qubit [3.399289369740637]
  We introduce parameterized DQC1 as a quantum machine learning model. We show that DQC1 is as powerful as quantum neural networks based on universal computation.
  arXiv  Detail & Related papers  (2024-11-05T02:46:27Z)
• The Space Just Above One Clean Qubit [0.0]
  In this paper, we show that despite its limitations, $frac12$BQP can carry out many well-known quantum computations. $frac12$BQP can simulate Instantaneous Quantum Polynomial Time (IQP), solve the Deutsch-Jozsa problem, Bernstein-Vazirani problem, Simon's problem, and period finding. We conjecture that $frac12$BQP cannot solve $3$-Forrelation.
  arXiv  Detail & Related papers  (2024-10-10T15:45:37Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Computational Supremacy of Quantum Eigensolver by Extension of Optimized Binary Configurations [0.0]
  We develop a quantum eigensolver based on a D-Wave Quantum Annealer (D-Wave QA) This approach performs iterative QA measurements to optimize the eigenstates $vert psi rangle$ without the derivation of a classical computer. We confirm that the proposed QE algorithm provides exact solutions within the errors of $5 times 10-3$.
  arXiv  Detail & Related papers  (2024-06-05T15:19:53Z)
• Scalability enhancement of quantum computing under limited connectivity through distributed quantum computing [0.8602553195689513]
  We benchmark the two-QPU entanglement-assisted distributed quantum computing with single-QPU quantum computing. We show the one-to-one correspondence of three figures of merits, namely average gate fidelity, heavy output probability, and linear cross-entropy.
  arXiv  Detail & Related papers  (2024-05-17T17:56:37Z)
• Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
  We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
  arXiv  Detail & Related papers  (2024-03-25T14:06:18Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• Measurement-induced phase transition for free fermions above one dimension [46.176861415532095]
  Theory of the measurement-induced entanglement phase transition for free-fermion models in $d>1$ dimensions is developed. Critical point separates a gapless phase with $elld-1 ln ell$ scaling of the second cumulant of the particle number and of the entanglement entropy.
  arXiv  Detail & Related papers  (2023-09-21T18:11:04Z)
• On the Role of Entanglement and Statistics in Learning [3.729242965449096]
  We make progress in understanding the relationship between learning models with access to entangled, separable and statistical measurements. We exhibit a class $C$ that gives an exponential separation between QSQ learning and quantum learning with entangled measurements. We prove superpolynomial QSQ lower bounds for testing purity, shadow tomography, Abelian hidden subgroup problem, degree-$2$ functions, planted bi-clique states and output states of Clifford circuits of depth.
  arXiv  Detail & Related papers  (2023-06-05T18:16:03Z)
• Replicability in Reinforcement Learning [46.89386344741442]
  We focus on the fundamental setting of discounted MDPs with access to a generative model. Inspired by Impagliazzo et al. [2022], we say that an RL algorithm is replicable if, with high probability, it outputs the exact same policy after two executions.
  arXiv  Detail & Related papers  (2023-05-31T05:16:23Z)
• Solving Oscillation Problem in Post-Training Quantization Through a Theoretical Perspective [74.48124653728422]
  Post-training quantization (PTQ) is widely regarded as one of the most efficient compression methods practically. We argue that an overlooked problem of oscillation is in the PTQ methods.
  arXiv  Detail & Related papers  (2023-03-21T14:52:52Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Equivalence Checking of Quantum Circuits with the ZX-Calculus [3.610459670994051]
  State-of-the-art quantum computers are capable of running increasingly complex algorithms. The need for automated methods to design and test potential applications rises. Recently, new methods have been proposed that tackle this problem.
  arXiv  Detail & Related papers  (2022-08-26T18:00:01Z)
• Quantum Approximation of Normalized Schatten Norms and Applications to Learning [0.0]
  This paper addresses the problem of defining a similarity measure for quantum operations that can be textitefficiently estimated We develop a quantum sampling circuit to estimate the normalized Schatten 2-norm of their difference and prove a Poly$(frac1epsilon)$ upper bound on the sample complexity. We then show that such a similarity metric is directly related to a functional definition of similarity of unitary operations using the conventional fidelity metric of quantum states.
  arXiv  Detail & Related papers  (2022-06-23T07:12:10Z)
• Polyak-Ruppert Averaged Q-Leaning is Statistically Efficient [90.14768299744792]
  We study synchronous Q-learning with Polyak-Ruppert averaging (a.k.a., averaged Q-leaning) in a $gamma$-discounted MDP. We establish normality for the iteration averaged $barboldsymbolQ_T$. In short, our theoretical analysis shows averaged Q-Leaning is statistically efficient.
  arXiv  Detail & Related papers  (2021-12-29T14:47:56Z)
• Outcome determinism in measurement-based quantum computation with qudits [0.0]
  In measurement-based quantum computing, computation is carried out by a sequence of measurements and corrections on an entangled state. We introduce flow-based methods for MBQC with qudit graph states, which we call Zd-flow, when the local dimension is an odd prime. Our main results are that Zd-flow is a necessary and sufficient condition for a strong form of outcome determinism.
  arXiv  Detail & Related papers  (2021-09-28T15:36:36Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Symmetry Protected Quantum Computation [0.0]
  We consider a model of quantum computation using qubits. It is possible to measure whether a given pair are in a singlet (total spin $0$) or triplet (total spin $1$) state.
  arXiv  Detail & Related papers  (2021-05-10T20:09:27Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning [59.71676469100807]
  This work sharpens the sample complexity of synchronous Q-learning to an order of $frac|mathcalS|| (1-gamma)4varepsilon2$ for any $0varepsilon 1$. Our finding unveils the effectiveness of vanilla Q-learning, which matches that of speedy Q-learning without requiring extra computation and storage.
  arXiv  Detail & Related papers  (2021-02-12T14:22:05Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.