Related papers: A short note on the 0-fidelity
In this paper, we present an overview of the recent developments of functional quantization of stochastic processes, with an emphasis on the quadratic case. Functional quantization is a way to approximate a process, viewed as a…
Coherence measures and their operational interpretations lay the cornerstone of coherence theory. In this paper, we introduce a class of coherence measures with $\alpha$-affinity, say $\alpha$-affinity of coherence for $\alpha \in (0, 1)$.…
Quantum fidelity between two density matrices, $F(\rho_1,\rho_2)$ is usually defined as the trace of the operator ${\cal F}=\sqrt{\sqrt{\rho_1} \rho_2 \sqrt{\rho_1}}$. We study the logarithmic spectrum of this operator, which we denote by…
In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control problems. To illustrate the error estimates and to demonstrate differences to other…
Mayers, Lo and Chau argued that all quantum bit commitment protocols are insecure, because there is no way to prevent an Einstein-Podolsky-Rosen (EPR) cheating attack. However, Yuen presented some protocols which challenged the previous…
In this work we aim at quantifying quantum channel output similarity. In order to achieve this, we introduce the notion of quantum channel superfidelity, which gives us an upper bound on the quantum channel fidelity. This quantity is…
The concept of fidelity has been introduced to characterize the stability of a quantum-mechanical system against perturbations. The fidelity amplitude is defined as the overlap integral of a wave packet with itself after the development…
With the continued scaling of quantum processors, holistic benchmarks are essential for extensively evaluating device performance. Layer fidelity is a benchmark well-suited to assessing processor performance at scale. Key advantages of this…
A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a…
We derive an exact expression for the quantumness of a Hilbert space (defined in quant-ph/0302092), and show that in composite Hilbert spaces the signal states must contain at least some entangled states in order to achieve such a…
Within the framework of simple perturbation theory, recurrence time of quantum fidelity is related to the period of the classical motion. This indicates the possibility of recurrence in near integrable systems. We have studied such…
The laws of quantum mechanics place fundamental limits on the accuracy of measurements and therefore on the estimation of unknown parameters of a quantum system. In this work, we prove lower bounds on the size of confidence regions reported…
In this work, we demonstrate that the zero-fidelity, an approximation to the process fidelity, when combined with randomized benchmarking, becomes robust to state preparation and measurement (SPAM) errors. However, as randomized…
On a class of memoryless quantum channels which includes the depolarizing channel, the highest fidelity of quantum error-correcting codes of length n and rate R is proven to be lower bounded by 1-exp[-nE(R)+o(n)] for some function E(R). The…
The minimum accuracy heuristic evaluates quantum feature maps without requiring full quantum support vector machine (QSVM) training. However, the original formulation is computationally expensive, restricted to balanced datasets, and lacks…
We consider the problem of multi-fidelity zeroth-order optimization, where one can evaluate a function $f$ at various approximation levels (of varying costs), and the goal is to optimize $f$ with the cheapest evaluations possible. In this…
Fidelity approach to quantum phase transitions uses the overlap between ground states of the system to gain some information about its quantum phases. Such an overlap is called fidelity. We illustrate how this approach works in the one…
This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis problems in higher-order programming languages. We give exact characterizations of the computational complexity of 0CFA, the $k$CFA hierarchy, and…
The quantum threshold theorem shows that a noisy quantum computer can accurately and efficiently simulate any ideal quantum computation provided that noise is weakly correlated and its strength is below a critical value known as the quantum…
We relate gate fidelities of experimentally realized quantum operations to the broadcasting property of their ideal operations, and show that the more parties a given quantum operation can broadcast to, the higher gate fidelities of its…