Related papers: Computing coherence vectors and correlation matric…
A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their…
As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this…
By using a coherent state quantization of paragrassmann variables, operators are constructed in finite Hilbert spaces. We thus obtain in a straightforward way a matrix representation of the paragrassmann algebra. This algebra of finite…
We analyse dissipation in quantum computation and its destructive impact on efficiency of quantum algorithms. Using a general model of decoherence, we study the time evolution of a quantum register of arbitrary length coupled with an…
The effect of the inevitable coupling to external degrees of freedom of a quantum computer are examined. It is found that for quantum calculations (in which the maintenance of coherence over a large number of states is important), not only…
The calculation of dynamic response functions is expected to be an early application benefiting from rapidly developing quantum hardware resources. The ability to calculate real-time quantities of strongly-correlated quantum systems is one…
Quantum coherence is an important quantum resource and it is intimately related to various research fields. The geometric coherence is a coherence measure both operationally and geometrically. We study the trade-off relation of geometric…
Quantum coherence as an important quantum resource plays a key role in quantum theory. In this paper, using entropy-based measures, we investigate the relations between quantum correlated coherence, which is the coherence between subsystems…
Quantum algorithms that can speed up certain tasks, such as factorisation and unstructured search, have driven a decades-long development of quantum computers and quantum technologies. Yet, outside specialized applications, quantum…
Quantum discord is a more general measure of quantum correlations than entanglement and has been proposed as a resource in certain quantum information processing tasks. The computation of discord is mostly confined to two-qubit systems for…
In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…
Quantum computers use quantum mechanical phenomena to perform conventionally intractable calculations for specific problems. Despite being universal machines, quantum computers are not expected to replace classical computers, but rather, to…
Perturbation theory in quantum mechanics studies how quantum systems interact with their environmental perturbations. Harmonic perturbation is a rare special case of time-dependent perturbations in which exact analysis exists. Some…
Amplitude amplification is one of primary tools in building algorithms for quantum computers. This technique generalizes key ideas of the Grover search algorithm. Potentially useful modifications are connected with changing phases in the…
A large spectrum of problems in classical physics and engineering, such as turbulence, is governed by nonlinear differential equations, which typically require high-performance computing to be solved. Over the past decade, however, the…
This is a review of recent research exploring and extending present-day quantum computing capabilities for fusion energy science applications. We begin with a brief tutorial on both ideal and open quantum dynamics, universal quantum…
Quantum computer is the key to controlling complex processes. If its hardware, in general is successfully created on the basis of the physical baggage of the 20th century, the mathematical software is fundamentally lagging behind. Feynman's…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
Networks based on entangled quantum systems enable interesting applications in quantum information processing and the understanding of the resulting quantum correlations is essential for advancing the technology. We show that the theory of…
Using Bloch's parametrization for qudits ($d$-level quantum systems), we write the Hilbert-Schmidt distance (HSD) between two generic $n$-qudit states as an Euclidean distance between two vectors of observables mean values in…