Related papers: Quantum Merlin-Arthur and proofs without relative …
Quantum metrology aims to exploit quantum phenomena to overcome classical limitations in the estimation of relevant parameters. We consider a probe undergoing a phase shift $\varphi$ whose generator is randomly sampled according to a…
We construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions. Previously, building on the prior work of Mahadev (FOCS '18), Bartusek et al. (CRYPTO '22) also…
Whether the quantum mechanics (QM) is non-local is an issue disputed for a long time. The violation of the Bell-type inequalities was considered as proving this non-locality. However, these inequalities are constructed on a class of local…
We comment on the so-called negative-result experiments (also known as null measurements, interaction-free measurements, and so on) in quantum mechanics (QM), in the light of the new general understanding of the quantum-measurement…
The process algebra has been used successfully to provide a novel formulation of quantum mechanics in which non-relativistic quantum mechanics (NRQM) emerges as an effective theory asymptotically. The process algebra is applied here to the…
We show that, for an exactly solvable quantum spin model, a discontinuity in the first derivative of the ground state concurrence appears in the absence of quantum phase transition. It is opposed to the popular belief that the…
Under ideal conditions, quantum metrology promises a precision gain over classical techniques scaling quadratically with the number of probe particles. At the same time, no-go results have shown that generic, uncorrelated noise limits the…
For any state in four-dimensional system, the quantum violation of an inequality based on the Peres-Mermin proof for testing noncontextual realist models has experimentally been corroborated. In the Peres-Mermin proof, an array of nine…
We develop a generalized theory of quantum error correction (QEC) that applies to any linear map, in particular maps that are not completely positive (CP). This theory describes entanglement-assisted QEC for invertible noise maps, which we…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
The generalized Weyl transform of index $\alpha$ is used to implement the time-slice definition of the phase space path integral yielding the Feynman kernel in the case of noncommutative quantum mechanics. As expected, this representation…
The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We first consider Grover's quantum search algorithm, noticing…
We review several procedures of quantization formulated in the framework of (classical) phase space M. These quantization methods consider Quantum Mechanics as a "deformation" of Classical Mechanics by means of the "transformation" of the…
Quantum annealing (QA) is one of the efficient methods to calculate the ground-state energy of a problem Hamiltonian. In the absence of noise, QA can accurately estimate the ground-state energy if the adiabatic condition is satisfied.…
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers.…
Quantum-enhanced measurements exploit quantum mechanical effects for increasing the sensitivity of measurements of certain physical parameters and have great potential for both fundamental science and concrete applications. Most of the…
The complexity class QMA is the quantum analog of the classical complexity class NP. The functional analogs of NP and QMA, called functional NP (FNP) and functional QMA (FQMA), consist in either outputting a (classical or quantum) witness,…
We present an efficient proof system for Multipoint Arithmetic Circuit Evaluation: for every arithmetic circuit $C(x_1,\ldots,x_n)$ of size $s$ and degree $d$ over a field ${\mathbb F}$, and any inputs $a_1,\ldots,a_K \in {\mathbb F}^n$,…
We study the ability of efficient quantum verifiers to decide properties of exponentially large subsets given either a classical or quantum witness. We develop a general framework that can be used to prove that QCMA machines, with only…
Optimisation plays a central role in a wide range of scientific and industrial applications, and quantum computing has been widely proposed as a means to achieve computational advantages in this domain. To date, research into the design of…