Related papers: Computational Complexity and Simulability of Non-H…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…
Non-Markovian open quantum systems represent the most general dynamics when the quantum system is coupled with a bath environment. The quantum dynamics arising from many important applications are non-Markovian. Although for special cases,…
Non-Hermitian physics has emerged as a rich field of study, with applications ranging from $PT$-symmetry breaking and skin effects to non-Hermitian topological phase transitions. Yet most studies remain restricted to small-scale or…
Exponentiation of Hamiltonians refers to a mathematical operation to a Hamiltonian operator, typically in the form e^(-i.t.H), where H is the Hamiltonian and t is a time parameter. This operation is fundamental in quantum mechanics,…
Simulating open quantum systems on quantum computers presents a fundamental challenge: open quantum dynamics are intrinsically nonunitary, whereas quantum computers operate through unitary evolution. Conventional approaches overcome this…
Unitarity is a cornerstone of quantum theory, ensuring the conservation of probability and information. Although non-Hermitian Hamiltonians are typically associated with open or dissipative systems, pseudo-Hermitian quantum mechanics shows…
As research on building scalable quantum computers advances, it is important to be able to certify their correctness. Due to the exponential hardness of classically simulating quantum computation, straight-forward verification through…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…
A quantum system coupled to a bath at some fixed, finite temperature converges to its Gibbs state. This thermalization process defines a natural, physically-motivated model of quantum computation. However, whether quantum computational…
The simulation of quantum systems is a task for which quantum computers are believed to give an exponential speedup as compared to classical ones. While ground states of one-dimensional systems can be efficiently approximated using Matrix…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However,…
This work analyses the performance of quantum circuits and general processes to transform $k$ uses of an arbitrary unitary operation $U$ into another unitary operation $f(U)$. When the desired function $f$ a homomorphism, i.e.,…
In the age of noisy quantum processors, the exploitation of quantum symmetries can be quite beneficial in the efficient preparation of trial states, an important part of the variational quantum eigensolver algorithm. The benefits include…
Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have…
Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materials, where intricate quantum effects give rise to…