Related papers: Two bases suffice for QMA1-completeness
We study the computational complexity of the Local Hamiltonian problem under the promise that its ground state is succinctly represented. We show that the Succinct State 2-Local Hamiltonian problem, for qubit Hamiltonians, is (promise)…
With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…
Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of $q$-ary AQCs is extended…
The phase diagram of a material is of central importance to describe the properties and behaviour of a condensed matter system. We prove that the general task of determining the quantum phase diagram of a many-body Hamiltonian is…
This paper introduces a construction of quantum CSS codes from a tuple of component CSS codes and two collections of subsets. The resulting codes have parallelizable encoding and syndrome measurement circuits and built-in redundancy in the…
Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tolerant to a certain degree. We examine its implementation based on Zeeman coupling with a rotating field and isotropic Heisenberg interaction,…
We propose the implementation of a deterministic Hadamard gate for logical photonic qubits encoded in superpositions of coherent states of a harmonic oscillator. The proposed scheme builds on a recently introduced set of conditional…
The Hermiticity axiom of quantum mechanics guarantees that the energy spectrum is real and the time evolution is unitary (probability-preserving). Nevertheless, non-Hermitian but $\mathcal{PT}$-symmetric Hamiltonians may also have real…
Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancillary clock register tracking the progress of the computation.…
We present an exact quantum algorithm for solving the Exact Satisfiability (XSAT) problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts:…
In this note, we present a construction of new nonbinary quantum codes with good parameters. These codes are obtained by applying the Calderbank-Shor-Steane (CSS) construction. In order to do this, we show the existence of (classical)…
By using the Feynman-Hibbs prescription for the evolution amplitude, we quantize the system of a damped harmonic oscillator coupled to its time-reversed image, known as Bateman's dual system. The time-dependent quantum states of such a…
The solving of linear systems provides a rich area to investigate the use of nearer-term, noisy, intermediate-scale quantum computers. In this work, we discuss hybrid quantum-classical algorithms for skewed linear systems for…
In this article, we discussed certain properties of non-Hermitian $\CP$-symmetry Hamiltonian, and it is shown that a consistent physical theory of quantum mechanics can be built on a ${\cal C} \CP$-symmetry Hamiltonian. In particular, we…
We simulate the logical Hadamard gate in the surface code under a circuit-level noise model, compiling it to a physical circuit on square-grid connectivity hardware. Our paper is the first to do this for a logical unitary gate on a quantum…
Quantum machine learning models are designed for performing learning tasks. Some quantum classifier models are proposed to assign classes of inputs based on fidelity measurements. Quantum Hadamard test is a well-known quantum algorithm for…
We explain the mechanism leading to directed chaotic transport in Hamiltonian systems with spatial and temporal periodicity. We show that a mixed phase space comprising both regular and chaotic motion is required and derive a classical sum…
We show that the basis graph of an even delta-matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges $e$ and $f$ sharing a common end, it has a Hamiltonian cycle using $e$ and avoiding…
Finding the ground state energy of electrons subject to an external electric field is a fundamental problem in computational chemistry. We prove that this electronic-structure problem, when restricted to a fixed single-particle basis and…
The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether or not the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum…