Pinned QMA: The power of fixing a few qubits in proofs

• URL: http://arxiv.org/abs/2001.03636v2
• Date: Fri, 23 Oct 2020 12:08:15 GMT
• Title: Pinned QMA: The power of fixing a few qubits in proofs
• Authors: Daniel Nagaj, Dominik Hangleiter, Jens Eisert, and Martin Schwarz
• Abstract summary: We show that pinning a single qubit via often repeated measurements results in universal quantum computation already with commuting and stoquastic Hamiltonians. We hence identify a comprehensive picture of the computational power of pinning, reminiscent of the power of the one clean qubit model.
• Score: 0.6299766708197883
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: What could happen if we pinned a single qubit of a system and fixed it in a particular state? First, we show that this can greatly increase the complexity of static questions -- ground state properties of local Hamiltonian problems with restricted types of terms. In particular, we show that the Pinned commuting and Pinned Stoquastic Local Hamiltonian problems are QMA complete. Second, we show that pinning a single qubit via often repeated measurements also results in universal quantum computation already with commuting and stoquastic Hamiltonians. Finally, we discuss variants of the Ground State Connectivity (GSCON) problem in light of pinning, and show that Stoquastic GSCON is QCMA complete. We hence identify a comprehensive picture of the computational power of pinning, reminiscent of the power of the one clean qubit model.

Related papers

• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
  Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another. We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST. The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
  arXiv  Detail & Related papers  (2024-05-10T23:46:35Z)
• Hamiltonian-reconstruction distance as a success metric for the Variational Quantum Eigensolver [1.0916270449935084]
  Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm for quantum simulation that can run on near-term quantum hardware. A challenge in VQE is to know how close the algorithm's output solution is to the true ground state, when the true ground state and ground-state energy are unknown. Recent developments in Hamiltonian reconstruction give a metric can be used to assess the quality of a variational solution to a Hamiltonian-eigensolving problem.
  arXiv  Detail & Related papers  (2024-03-18T17:28:06Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Circuit-to-Hamiltonian from tensor networks and fault tolerance [14.00987234726578]
  We define a map from an arbitrary quantum circuit to a local Hamiltonian whose ground state encodes the quantum computation. We show that any state with energy density exponentially small in the circuit depth encodes a noisy version of the quantum computation. We also show that any combinatorial state with energy density PCPly small in depth encodes the quantum tensor with adversarial noise.
  arXiv  Detail & Related papers  (2023-09-28T14:39:13Z)
• Local Hamiltonian Problem with succinct ground state is MA-Complete [0.788657961743755]
  Finding the ground energy of a quantum system is a fundamental problem in condensed matter physics and quantum chemistry. Existing classical algorithms for tackling this problem often assume that the ground state has a succinct classical description. We study the complexity of the local Hamiltonian problem with succinct ground state and prove it is MA-Complete.
  arXiv  Detail & Related papers  (2023-09-18T21:08:51Z)
• Catastrophic failure of quantum annealing owing to non-stoquastic Hamiltonian and its avoidance by decoherence [0.0]
  We present examples showing that non-stoquastic Hamiltonians can lead to catastrophic failure of Quantum annealing (QA) In our example, owing to a symmetry, the Hamiltonian is block-diagonalized, and a crossing occurs during the QA, which leads to a complete failure of the ground-state search. Our results provide a deep insight into the fundamental mechanism of QA.
  arXiv  Detail & Related papers  (2022-09-22T13:10:58Z)
• Quantum annealing with symmetric subspaces [0.0]
  We propose a drive Hamiltonian that preserves the symmetry of the problem Hamiltonian for more efficient Quantum annealing (QA) As non-adiabatic transitions occur only inside the specific subspace, our approach can potentially suppress unwanted non-adiabatic transitions. We find that our scheme outperforms the conventional scheme in terms of the fidelity between the target ground state and the states after QA.
  arXiv  Detail & Related papers  (2022-09-20T09:44:23Z)
• Stoquasticity in circuit QED [78.980148137396]
  We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems. We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
  arXiv  Detail & Related papers  (2020-11-02T16:41:28Z)
• 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)

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.