Related papers: Efficient Classical Simulation of the DQC1 Circuit…
We study the level surfaces of quantum discord for a class of two-qubit states with parallel nonzero Bloch vectors. The dynamic behavior of quantum discord under decoherence is investigated. It is shown that a class of X states has sudden…
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…
The usefulness of solid-state spins in quantum technologies depends on how long they can remain in a coherent superposition of quantum states. This Colloquium discusses how first-principles simulations can predict spin dynamics for…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
Variational quantum circuits (VQCs) are a central component of many quantum machine learning algorithms, offering a hybrid quantum-classical framework that, under certain aspects, can be considered similar to classical deep neural networks.…
Optimization of circuits is an essential task for both quantum and classical computers to improve their efficiency. In contrast, classical logic optimization is known to be difficult, and a lot of heuristic approaches have been developed so…
We calculate steady-state properties of a strongly correlated quantum dot under voltage bias by means of non-equilibrium Cluster Perturbation Theory and the non-equilibrium Variational Cluster Approach, respectively. Results for the…
Quantum discord as a measure of the quantum correlations cannot be easily computed for most of density operators. In this paper, we present a measure of the total quantum correlations that is operationally simple and can be computed…
Scaling quantum computers, i.e., quantum processing units (QPUs) to enable the execution of large quantum circuits is a major challenge, especially for applications that should provide a quantum advantage over classical algorithms. One…
One-way quantum deficit and quantum discord are two important measures of quantum correlations. We revisit the relationship between them in two-qubit systems. We investigate the conditions that both one-way quantum deficit and quantum…
We provide algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic model of a distributed quantum computer. As a result, the…
Quantum circuit compilation comprises many computationally hard reasoning tasks that nonetheless lie inside #$\mathbf{P}$ and its decision counterpart in $\mathbf{PP}$. The classical simulation of general quantum circuits is a core example.…
The ground state of a quantum spin chain is a natural playground for investigating correlations. Nevertheless, not all correlations are genuinely of quantum nature. Here we review the recent progress to quantify the 'quantumness' of the…
Adaptive quantum circuits employ unitary gates assisted by mid-circuit measurement, classical computation on the measurement outcome, and the conditional application of future unitary gates based on the result of the classical computation.…
We investigate the disappearance of discord in 2- and multi-qubit systems subject to decohering influences. We formulate the computation of quantum discord in terms of the generalized Bloch vector, which gives useful insights on the time…
Quantum computing systems need to be benchmarked in terms of practical tasks they would be expected to do. Here, we propose 3 "application-motivated" circuit classes for benchmarking: deep (relevant for state preparation in the variational…
This is a 1-page comment on a wrong paper that recently appeared in PRL (Phys. Rev. Lett. 86 (23), 5393 (2001), also quant-ph/0101004). The authors claim to have shown that using a quantum computer gives an "exponential advantage" for…
Quantum computational advantage is a critical milestone for near-term quantum technologies and an essential step towards building practical quantum computers. Recent successful demonstrations of quantum computational advantage owe much to…
Motivated by improving the understanding of the quantum-to-classical transition we use a simple model of classical discrete interactions for studying the discrete-to-continuous transition in the classical harmonic oscillator. A parallel is…
In a pair of correlated quantum systems a measurement in one corresponds to a change in the state of the other. In the process, information is lost. Measurement along which set of projectors would accompany minimum loss in information…