Related papers: Phase Transition for Random Quantified XOR-Formula…
We study the performances of stochastic heuristic search algorithms on Uniquely Extendible Constraint Satisfaction Problems with random inputs. We show that, for any heuristic preserving the Poissonian nature of the underlying instance, the…
Recently, a superradiant phase transition first predicted theoretically in the quantum Rabi model (QRM) has been verified experimentally. This further stimulates the interest in the study of the process of phase transition and the nature of…
Pronounced structural changes within individual configurations (Type I QPT), superimposed on an abrupt crossing of these configurations (Type II QPT), define the notion of intertwined quantum phase transitions (QPTs). We discuss and present…
We review quantum phase transitions of spin systems in transverse magnetic fields taking the examples of the spin-1/2 Ising and XY models in a transverse field. Beginning with an overview of quantum phase transitions, we introduce a number…
The paper reassesses the old dilemma "compact vs. extended phase" in the quantum theory of the rotator and the Josephson junction and the analogy of these two systems with the a particle moving in a periodic potential. This dilemma is in…
Regular signed SAT is a variant of the well-known satisfiability problem in which the variables can take values in a fixed set V \subset [0,1], and the `literals' have the form "x \le a" or "x \ge a". We answer some open question regarding…
We report dynamical quantum phase transition portrait in the alternating field transverse XY spin chain with Dzyaloshinskii-Moriya interaction by investigating singularities in the Loschmidt echo and the corresponding rate function after a…
We study the problem of estimating a $k$-sparse signal ${\mbox{$\beta$}}_0\in{\bf R}^p$ from a set of noisy observations ${\bf y}\in{\bf R}^n$ under the model ${\bf y}={\bf X}{\mbox{$\beta$}}+{\bf w}$, where ${\bf X}\in{\bf R}^{n\times p}$…
Quantum computing presents a promising alternative to classical computational methods for modeling strongly correlated materials with partially filled d orbitals. In this study, we perform a comprehensive quantum resource estimation using…
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized…
We investigate various quantum phase transitions of attractive two-species bosons in a square lattice. Using the algorithm based on the tensor product states, the phase boundaries of the pair superfluid states with nonzero pair condensate…
- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…
The general-purpose interactive theorem-proving assistant called Prove-It was used to verify the Quantum Phase Estimation (QPE) algorithm, specifically claims about its outcome probabilities. Prove-It is unique in its ability to express…
Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…
In a recent work, Le Hur has shown that dissipative coupling to gate electrodes may play an important role in a quantum box near its degeneracy point [K. Le Hur, Phys. Rev. Lett. {\bf 92}, 196804 (2004)]: While quantum fluctuations of the…
Quantum phase transitions in the one-dimensional extended quantum compass model in transverse field are studied by using the Jordan-Wigner transformation. This model is always gapful except at the critical surfaces where the energy gap…
We study the problem of satisfiability of randomly chosen clauses, each with K Boolean variables. Using the cavity method at zero temperature, we find the phase diagram for the K=3 case. We show the existence of an intermediate phase in the…
Quantization-aware training (QAT) simulates a quantization process during training to lower bit-precision of weights/activations. It learns quantized weights indirectly by updating latent weights,i.e., full-precision inputs to a quantizer,…
The dynamics at the critical-point of a general first-order quantum phase transition in a finite system is examined, from an algebraic perspective. Suitable Hamiltonians are constructed whose spectra exhibit coexistence of states…
We demonstrate a universal physical mechanism to probe the macroscopic quantum phase transition based on circuit QED architecture. We found that, with certain parameters, the Josephson junction qubit array behaves as an antiferromagnetic…