Related papers: Sufficient condition for validity of quantum adiab…
Suppressing undesired nonunitary effects is a major challenge in quantum computation and quantum control. In this work, by considering the adiabatic dynamics in presence of a surrounding environment, we theoretically and experimentally…
The quantum threshold theorem shows that a noisy quantum computer can accurately and efficiently simulate any ideal quantum computation provided that noise is weakly correlated and its strength is below a critical value known as the quantum…
In order to model and evaluate large-scale quantum systems, e.g. quantum computer and quantum annealer, it is necessary to quantify the ``quantumness" of such systems. In this paper, we discuss the dimensionless combinations of basic…
We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…
This paper presents a formal approach to explaining change of inference in Quantitative Bipolar Argumentation Frameworks (QBAFs). When drawing conclusions from a QBAF and updating the QBAF to then again draw conclusions (and so on), our…
A. Capelli gave a necessary and sufficient condition for the reducibility of $x^n-a$ over $\Q$. In this article, we are providing an alternate elementary proof for the same.
The quantum adiabatic theorem, a cornerstone of quantum mechanics, asserts that a gapped quantum system remains in its instantaneous eigenstate during sufficiently slow evolution, provided no resonances occur. Here we challenge this…
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…
This paper is concerned with the low regularity well-posedness of the adiabatic limit of the quantum Zakharov system, which is a modified nonlinear Schr\"odinger equation (NLSE). As the quantum parameter tends to zero, the modified NLSE…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
We introduce a counter-diabatic approach for deriving Hamiltonians modeling superchargable quantum batteries (QBs). A necessary requirement for the supercharging process is the existence of multipartite interactions among the cells of the…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
This paper presents the general form and essential properties of the q-optimal measure following the approach of Delbaen and Schachermayer (1996) and proves its existence under mild conditions. Most importantly, it states a necessary and…
We derive a single general Bell inequality which is a necessary and sufficient condition for the correlation function for N particles to be describable in a local and realistic picture, for the case in which measurements on each particle…
We provide necessary and sufficient conditions for the partial transposition of bipartite harmonic quantum states to be nonnegative. The conditions are formulated as an infinite series of inequalities for the moments of the state under…
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors,…
In this work we generalize some of the previously known adiabatic theorems to situations with non-unitary evolutions in Banach spaces. We prove adiabatic theorems with uniform gap condition (generalizing a theorem of Abou Salem), adiabatic…
We illustrate the adiabatic quantum computing solution of the knapsack problem with both integer profits and weights. For problems with $n$ objects (or items) and integer capacity $c$, we give specific examples using both an Ising class…
We present explicit examples to show that the `compatibility criterion' is capable of providing a {\em necessary} and {\em sufficient} condition for any regular configuration to be compatible with the state of hydrostatic equilibrium. This…
The minimal work principle states that work done on a thermally isolated equilibrium system is minimal for adiabatically slow (reversible) realization of a given process. This principle, one of the formulations of the second law, is studied…