386 citations
- Slovak Academy of SciencesSK17 papers
- Uppsala UniversitySE9 papers
- Stony Brook UniversityUS6 papers
- Institute of Physics of the Slovak Academy of SciencesSK5 papers
- Czech Academy of Sciences, Astronomical InstituteCZ4 papers
- Imperial College LondonGB4 papers
- Max Planck Institute for Solid State ResearchDE4 papers
- P.N. Lebedev Physical Institute of the Russian Academy of SciencesRU4 papers
- University of EdinburghGB4 papers
- University of ViennaAT4 papers
- Astronomical Institute of the Slovak Academy of SciencesSK3 papers
- Charles UniversityCZ3 papers
5 papers · 2 filters
Separation between Classical and Quantum Winning Strategies for the Matching Game
Ivan Fialík
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum inf…
Entanglement-annihilating and entanglement-breaking channels
Lenka Moravčíková, Mario Ziman
We introduce and investigate a family of entanglement-annihilating channels. These channels are capable of destroying any quantum entanglement within the system they act on. We sho…
Unitary Noise and the Mermin-GHZ Game
Ivan Fialík
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum inf…
Approximating incompatible von Neumann measurements simultaneously
Teiko Heinosaari, Maria Anastasia Jivulescu, Daniel Reitzner +1
We study the problem of performing orthogonal qubit measurements simultaneously. Since these measurements are incompatible, one has to accept additional imprecision. An optimal joi…
Quantum-state preparation with universal gate decompositions
Martin Plesch, Časlav Brukner
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as cont…