Related papers: Adversary lower bounds in the Hamiltonian oracle m…
James' effective Hamiltonian method has been extensively adopted to investigate largely detuned interacting quantum systems. This method is just corresponding to the second-order perturbation theory, and cannot be exploited to treat the…
The growing number of adversarial attacks in recent years gives attackers an advantage over defenders, as defenders must train detectors after knowing the types of attacks, and many models need to be maintained to ensure good performance in…
Recall the classical hypothesis testing setting with two convex sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p in P or from a distribution q in Q and wants to decide from which set the…
In this work, we point out the problem of observed adversaries for deep policies. Specifically, recent work has shown that deep reinforcement learning is susceptible to adversarial attacks where an observed adversary acts under…
The vulnerability of Deep Neural Networks to Adversarial Attacks has fuelled research towards building robust models. While most Adversarial Training algorithms aim at defending attacks constrained within low magnitude Lp norm bounds,…
We consider online algorithms as a request-answer game. An adversary that generates input requests, and an online algorithm answers. We consider a generalized version of the game that has a buffer of limited size. The adversary loads data…
We prove some boundary rigidity results for the hemisphere under a lower bound for Ricci curvature. The main result can be viewed as the Ricci version of a conjecture of Min-Oo.
We develop a new boundary condition for the weak inverse mean curvature flow, which gives canonical and non-trivial solutions in bounded domains. Roughly speaking, the boundary of the domain serves as an outer obstacle, and the evolving…
We consider models for the plateau transition in the integer quantum Hall effect. Starting from the network model, we construct a mapping to the Dirac Hamiltonian in two dimensions. In the general case, the Dirac Hamiltonian has randomness…
In this paper, we address the problem of prescribing non-constant $Q$ and boundary $T$ curvatures on the upper hemisphere $\mathbb{S}^4_+\subset \mathbb{R}^5$, via a conformal change of the background metric. This is equivalent to solve a…
We explore whether quantum advantages can be found for the zeroth-order online convex optimization problem, which is also known as bandit convex optimization with multi-point feedback. In this setting, given access to zeroth-order oracles…
The quantum adiabatic theorem states that if a quantum system starts in an eigenstate of the Hamiltonian, and this Hamiltonian varies sufficiently slowly, the system stays in this eigenstate. We investigate experimentally the conditions…
We investigate the connection between interference and computational power within the operationally defined framework of generalised probabilistic theories. To compare the computational abilities of different theories within this framework…
Quantum machine learning explores the interplay between machine learning and quantum physics, which may lead to unprecedented perspectives for both fields. In fact, recent works have shown strong evidences that quantum computers could…
Effective Hamiltonian methods are utilized to model the two-qubit cross-resonance gate for both the ideal two-qubit case and when higher levels are included. Analytic expressions are obtained in the qubit case and the higher-level model is…
We propose a couple of oracle construction methods for quantum pattern matching. We in turn show that one of the construct can be used with the Grover's search algorithm for exact and partial pattern matching, deterministically. The other…
A new method to compute the symplectic structure of a quantum field theory with non trivial boundary conditions is proposed. Following the suggestion in \cite{ho:gnus, ardalan}, we regard that the boundary conditions are second class…
We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis, and shows that van Dam's oracle interrogation is…
We discuss the problem of constructing self-adjoint and lower bounded Hamiltonians for a system of $n>2$ non-relativistic quantum particles in dimension three with contact (or zero-range or $\delta$) interactions. Such interactions are…
Conditions for the validity of the quantum adiabatic approximation are analyzed. For the case of linear Hamiltonians, a simple and general sufficient condition is derived, which is valid for arbitrary spectra and any kind of time variation.…