Related papers: Tighter Lower Bounds on Quantum Annealing Times
In these notes we address the canonical quantization of the cosmological models which appear as solutions of the low energy effective action of closed bosonic string theory (dilaton models). The analysis is restricted to the quantization of…
We show that combining ideas from the fields of quantum invariants and of optimal control can be used to design optimal quantum control solutions without explicit reference to quantum states. The states are specified only implicitly in…
A flexible job shop scheduling problem (FJSSP) poses a complex optimization task in modeling real-world process scheduling tasks with conflicting objectives. To tackle FJSSPs, approximation methods are employed to ensure solutions are…
We introduce a new type of boundary conditions, {\it smooth boundary conditions}, for numerical studies of quantum lattice systems. In a number of circumstances, these boundary conditions have substantially smaller finite-size effects than…
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a…
Quantum theory imposes fundamental limitations to the amount of information that can be carried by any quantum system. On the one hand, Holevo bound rules out the possibility to encode more information in a quantum system than in its…
There have been multiple attempts to demonstrate that quantum annealing and, in particular, quantum annealing on quantum annealing machines, has the potential to outperform current classical optimization algorithms implemented on CMOS…
In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically…
We propose that the importance of the quantum annealing procedure to find the ground state of frustrated decorated bond systems where 'entropic slowing down' happens due to peculiar density of states. Here, we use the time dependent…
Understanding entanglement cost in non-local quantum computation (NLQC) is relevant to complexity, cryptography, gravity, and other areas. This entanglement cost is largely uncharacterized; previous lower bound techniques apply to narrowly…
We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…
Entanglement is a central resource in quantum information science, yet its structure in high dimensions remains notoriously difficult to characterize. One of the few general results on high-dimensional entanglement is given by peel-off…
We consider the problem of distinguishing between a set of arbitrary quantum states in a setting in which the time available to perform the measurement is limited. We provide simple upper bounds on how well we can perform state…
Driving a quantum system periodically in time can profoundly alter its long-time dynamics and trigger topological order. Such schemes are particularly promising for generating non-trivial energy bands and gauge structures in quantum-matter…
Digital quantum simulation has broad applications in approximating unitary evolution of Hamiltonians. In practice, many simulation tasks for quantum systems focus on quantum states in the low-energy subspace instead of the entire Hilbert…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
We report on a time scaling technique to enhance the performances of quantum protocols in non-Hermitian systems. The considered time scaling involves no extra-couplings and yields a significant enhancement of the quantum fidelity for a…
In this paper we explore how non trivial boundary conditions could influence the entanglement entropy in a topological order in 2+1 dimensions. Specifically we consider the special class of topological orders describable by the quantum…
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement…
A quantum metrology protocol for parameter estimation is typically comprised of three stages: probe state preparation, sensing and then readout, where the time required for the first and last stages is usually neglected. In the present work…