Related papers: Hardness and Ease of Curing the Sign Problem for T…
Hamiltonian Learning (HL) is essential for validating quantum systems in quantum computing. Not all Hamiltonians can be uniquely recovered from a steady state. HL success depends on the Hamiltonian model and steady state. Here, we analyze…
All Hamiltonian complexity results to date have been proven by constructing a local Hamiltonian whose ground state -- or at least some low-energy state -- is a "computational history state", encoding a quantum computation as a superposition…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
We provide several applications of a previously introduced isomorphism between physical operations acting on two systems and entangled states [1]. We show: (i) how to implement (weakly) non-local two qubit unitary operations with a small…
We consider error suppression schemes in which quantum information is encoded into the ground subspace of a Hamiltonian comprising a sum of commuting terms. Since such Hamiltonians are gapped they are considered natural candidates for…
Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main…
The problem of estimating the spectral gap of a local Hamiltonian is known to be contained in the class $P^{QMA[log]}$: polynomial time with access to a logarithmic number of QMA queries. The problem was shown to be hard for…
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-SAT) problems represented by Ising-type Hamiltonians, and nonstoquastic problems which are obtained by adding extra couplings to the 2-SAT…
Quantum Monte Carlo (QMC) methods for the frustrated quantum spin systems occasionally suffer from the negative sign problem, which makes simulations exponentially harder for larger systems at lower temperatures and severely limits QMC's…
A quantum navigation problem concerns the identification of a time-optimal Hamiltonian that realises a required quantum process or task, under the influence of a prevailing `background' Hamiltonian that cannot be manipulated. When the task…
We consider stamps with different values (denominations) and same dimensions, and an envelope with a fixed maximum number of stamp positions. The local postage stamp problem is to find the smallest value that cannot be realized by the sum…
In complexity theory, there exists a famous unsolved problem whether NP can be P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that the SAT can be solved in plynomial time by means of quantum…
In this manuscript, we derive the principle of conservation of computational complexity. We measure computational complexity as the number of binary computations (decisions) required to solve a problem. Every problem then defines a unique…
Using nuclear magnetic resonance (NMR) techniques with three-qubit sample, we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to…
We build infinitely many geometrically distinct non-radial sign-changing solutions for the Hamiltonian-type elliptic systems $$ -\Delta u =|v|^{p-1}v\ \hbox{in}\ \mathbb{R}^N,\ -\Delta v =|u|^{q-1}u\ \hbox{in}\ \mathbb{R}^N,$$ where the…
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…
We study the optimization version of the set partition problem (where the difference between the partition sums are minimized), which has numerous applications in decision theory literature. While the set partitioning problem is NP-hard and…
Accurate, nontrivial quantum operations on many qubits are experimentally challenging. As opposed to the standard approach of compiling larger unitaries into sequences of 2-qubit gates, we propose a protocol on Hamiltonian control fields…
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…
We revisit the problem of characterizing band topology in dynamically-stable quadratic bosonic Hamiltonians that do not conserve particle number. We show this problem can be rigorously addressed by a smooth and local adiabatic mapping…