Related papers: Reexamining classical and quantum models for the D…
We compare the performance of a quantum radar based on two-mode squeezed states with a classical radar system based on correlated thermal noise. With a constraint of equal number of photons $N_S$ transmitted to probe the environment, we…
Perhaps the quantum state represents information about reality, and not reality directly. Wave function collapse is then possibly no more mysterious than a Bayesian update of a probability distribution given new data. We consider models for…
We analyze the method of encoding pairwise interactions of higher-than-binary discrete variables (these models are sometimes referred to as discrete quadratic models) into binary variables based on domain walls on one dimensional Ising…
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…
The standard quantum annealing algorithm tries to approach the ground state of a classical system by slowly decreasing the hopping rates of a quantum random walk in the configuration space of the problem, where the on-site energies are…
We developed a new quantum annealing (QA) algorithm for Dirichlet process mixture (DPM) models based on the Chinese restaurant process (CRP). QA is a parallelized extension of simulated annealing (SA), i.e., it is a parallel stochastic…
The non-equilibrium dynamics of quantum spin models is a most challenging topic, due to the exponentiality of Hilbert space; and it is central to the understanding of the many-body entangled states that can be generated by state-of-the-art…
Recent work [1] has claimed that a gate-model quantum-classical hybrid algorithm called bias-field digitized counterdiabatic quantum optimization (BF-DCQO) [2] outperforms D-Wave's annealing quantum computers in optimization tasks. We find…
The field of Quantum Computing has gathered significant popularity in recent years and a large number of papers have studied its effectiveness in tackling many tasks. We focus in particular on Quantum Annealing (QA), a meta-heuristic solver…
Using a semiclassical ansatz we analytically predict for the fidelity of delta-kicked rotors the occurrence of revivals and the disappearance of intermediate revival peaks arising from the breaking of a symmetry in the initial conditions. A…
The interaction of qubits with quantized modes of electromagnetic fields has been largely addressed in the quantum optics literature under the rotating wave approximation (RWA), where rapid oscillating terms in the qubit-mode interaction…
We investigate the critical properties of the Anisotropic Next-Nearest-Neighbor Ising (ANNNI) model using a feedback-based quantum algorithm (FQA). We demonstrate how this algorithm enables the computation of both ground and excited states…
One of the problems frequently mentioned as a candidate for quantum advantage is that of selecting a portfolio of financial assets to maximize returns while minimizing risk. In this paper we formulate several real-world constraints for use…
We theoretically predict, and experimentally verify with entangled photons, that outcome communication is not enough for hidden-state models to reproduce quantum steering. Hidden-state models with outcome communication correspond, in turn,…
We study the concepts of compatibility and separability and their implications for quantum and classical systems. These concepts are illustrated on a macroscopic model for the singlet state of a quantum system of two entangled spin 1/2 with…
Quantum annealing (QA) is a promising method for solving combinatorial optimization problems whose solutions are embedded into a ground state of the Ising Hamiltonian. This method employs two types of Hamiltonians: a driver Hamiltonian and…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
Quantum correlations have been pointed out as the most likely source of the speed-up in quantum computation. Here we analyzed the presence of quantum correlations in the implementation of Deutsch-Jozsa algorithm running in the DQC1 and DQCp…
Simulating quantum algorithms with classical resources generally requires exponential resources. However, heuristic classical approaches are often very efficient in approximately simulating special circuit structures, for example with…
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal…