Related papers: A short note on the 0-fidelity
Quantum technology has led to increasingly sophisticated and complex quantum devices. Assessing their reliability (quantum reliability) is an important issue. Although reliability theory for classical devices has been well developed in…
We revisit the fidelity as a measure for the stability and the complexity of the quantum motion of single and many-body systems. Within the context of cold atoms, we present on overview of applications of two fidelities which we call static…
We address the problem of verifying message passing programs, defined as a set of parallel processes communicating through unbounded FIFO buffers. We introduce a bounded analysis that explores a special type of computations, called…
Protocols for discriminating between a pair of channels or for estimating a channel parameter can often be aided by adaptivity or by entanglement between the probe states. This can make it difficult to bound the best possible performance…
The implementation of quantum gates with fidelities that exceed the threshold for reliable quantum computing requires robust gates whose performance is not limited by the precision of the available control fields. The performance of these…
It is important to study the behavior of a t-error correcting quantum code when the number of errors is greater than t, because it is likely that there are also small errors besides t large correctable errors. We give a lower bound for the…
We study fidelity susceptibility in one-dimensional asymmetric Hubbard model, and show that the fidelity susceptibility can be used to identify the universality class of the quantum phase transitions in this model. The critical exponents…
The rates of quantum cryptographic protocols are usually expressed in terms of a conditional entropy minimized over a certain set of quantum states. In particular, in the device-independent setting, the minimization is over all the quantum…
The fidelity of two pure states (also known as transition probability) is a symmetric function of two operators, and well-founded operationally as an event probability in a certain preparation-test pair. Motivated by the idea that the…
It is shown that the fidelity, a basic notion of quantum information science, may be used to characterize quantum phase transitions, regardless of what type of internal order is present in quantum many-body states. If the fidelity of two…
To certify that an experimentally implemented quantum transformation is a certain unitary operation U on a d-dimensional Hilbert space, it suffices to determine fidelities of output states for d+1 suitably chosen pure input states [Reich et…
Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…
Quantum state comparison, utilizing metrics like fidelity and trace distance, underpins the assessment of quantum networks within quantum information theory. While recent research has expanded theoretical understanding, incorporating error…
The ability to accurately control a quantum system is a fundamental requirement in many areas of modern science such as quantum information processing and the coherent manipulation of molecular systems. It is usually necessary to realize…
In almost all quantum applications, one of the key steps is to verify that the fidelity of the prepared quantum state meets expectations. In this Letter, we propose a new approach solving this problem using machine-learning techniques.…
Quantum $k$-minimum finding is a fundamental subroutine with numerous applications in combinatorial problems and machine learning. Previous approaches typically assume oracle access to exact function values, making it challenging to…
Fidelity is a fundamental and ubiquitous concept in quantum information theory. Fuchs-van de Graaf's inequalities deal with bounding fidelity from above and below. In this paper, we give a lower bound on the quantum fidelity between two…
The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…
We discuss the fidelity as a figure of merit in quantum error correction schemes. We show that when identifiable but uncorrectable errors occur as a result of the action of the channel, a common strategy that improves the fidelity actually…
We characterize the quantum gate fidelity in a state-independent manner by giving an explicit expression for its variance. The method we provide can be extended to calculate all higher order moments of the gate fidelity. Using these results…