Zobrazeno 1 - 10
of 243
pro vyhledávání: '"Cleve, Richard"'
A quantum position-verification scheme attempts to verify the spatial location of a prover. The prover is issued a challenge with quantum and classical inputs and must respond with appropriate timings. We consider two well-studied position-verificati
Externí odkaz:
http://arxiv.org/abs/2402.18648
Publikováno v:
Quantum 6, 755 (2022)
We consider a bipartite transformation that we call self-embezzlement and use it to prove a constant gap between the capabilities of two models of quantum information: the conventional model, where bipartite systems are represented by tensor products
Externí odkaz:
http://arxiv.org/abs/1811.12575
Autor:
Cleve, Richard, Wang, Chunhao
We consider the natural generalization of the Schr\"{o}dinger equation to Markovian open system dynamics: the so-called the Lindblad equation. We give a quantum algorithm for simulating the evolution of an $n$-qubit system for time $t$ within precisi
Externí odkaz:
http://arxiv.org/abs/1612.09512
Van Dam and Hayden introduced a concept commonly referred to as embezzlement, where, for any entangled quantum state $\phi$, there is an entangled catalyst state $\psi$, from which a high fidelity approximation of $\phi \otimes \psi$ can be produced
Externí odkaz:
http://arxiv.org/abs/1606.05061
Linear system games are a generalization of Mermin's magic square game introduced by Cleve and Mittal. They show that perfect strategies for linear system games in the tensor-product model of entanglement correspond to finite-dimensional operator sol
Externí odkaz:
http://arxiv.org/abs/1606.02278
Publikováno v:
Quantum Information and Computation, Vol. 16, No. 9 & 10 (2016) 0721-0756
A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice. We show that exact unitary 2-designs on n qubits can be implemented by
Externí odkaz:
http://arxiv.org/abs/1501.04592
Publikováno v:
Phys. Rev. Lett. 114, 090502 (2015)
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems.
Externí odkaz:
http://arxiv.org/abs/1412.4687
Publikováno v:
Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014), pp. 283-292 (2014)
We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a $d$-sparse Hamiltonian $H$ acting on
Externí odkaz:
http://arxiv.org/abs/1312.1414
We provide a quantum method for simulating Hamiltonian evolution with complexity polynomial in the logarithm of the inverse error. This is an exponential improvement over existing methods for Hamiltonian simulation. In addition, its scaling with resp
Externí odkaz:
http://arxiv.org/abs/1308.5424
Publikováno v:
Quantum Information and Computation 14, 0001 (2014)
We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates
Externí odkaz:
http://arxiv.org/abs/1211.4637