Martin Plesch

Martin Plesch


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 March 2011 in Physical Review A
Verified
Journal Article
Closed access
MPMartin Plesch
Martin Plesch
ČBČaslav Brukner
Časlav Brukner
In quantum computation every unitary operation can be decomposed into quantum circuits\char22{}a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces the total number of cnot gates from 2n to 23242n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

1 March 2021 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
MDMirdit Doda
Mirdit Doda
MHMarcus Huber
Marcus Huber
GMGláucia Murta
Gláucia Murta
MPMatej Pivoluska
Matej Pivoluska
MPMartin Plesch
Martin Plesch
CVChrysoula Vlachou
Chrysoula Vlachou
High-dimensional entanglement promises to increase the information capacity of photons and is now routinely generated, exploiting spatiotemporal degrees of freedom of single photons. A curious feature of these systems is the possibility of certifying entanglement despite strong noise in the data. We show that it is also possible to exploit this noisy high-dimensional entanglement for quantum key distribution by introducing a protocol that uses multiple subspaces of the high-dimensional system simultaneously. Our protocol can be used to establish a secret key even in extremely noisy experimental conditions, where qubit protocols fail. To show that, we analyze the performance of our protocol for noise models that apply to the two most commonly used sources of high-dimensional entanglement: time bins and spatial modes.

18 March 2010 in Physical Review A
Verified
Journal Article
Closed access
MPMartin Plesch
Martin Plesch
VBVladimír Bužek
Vladimír Bužek
We propose a scheme for an exact efficient transformation of a tensor product state of many identically prepared qubits into a state of a logarithmically small number of qubits. Using a quadratic number of elementary quantum gates we transform N identically prepared qubits into a state, which is nontrivial only on the first $\lceil${}log2(N+1)$\rceil${} qubits. This procedure might be useful for quantum memories, as only a small portion of the original qubits has to be stored. Another possible application is in communicating a direction encoded in a set of quantum states, as the compressed state provides a high-effective method for such an encoding.

7 December 2012 in Physical Review A
Verified
Journal Article
Closed access
JBJan Bouda
Jan Bouda
MPMatej Pivoluska
Matej Pivoluska
MPMartin Plesch
Martin Plesch
CWColin Wilmott
Colin Wilmott
In usual security proofs of quantum protocols the adversary (Eve) is expected to have full control over any quantum communication between any communicating parties (Alice and Bob). Eve is also expected to have full access to an authenticated classical channel between Alice and Bob. Unconditional security against any attack by Eve can be proved even in the realistic setting of device and channel imperfection. In this paper we show that the security of quantum key distribution protocols is ruined if one allows Eve to possess a very limited access to the random sources used by Alice. Such knowledge should always be expected in realistic experimental conditions via different side channels.

29 January 2003 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MPMartin Plesch
Martin Plesch
VBVladimír Bužek
Vladimír Bužek
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits, we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite system is associated with a point (vertex), while a bipartite entanglement between two specific qubits is represented by a connection (edge) between these points. We prove that any such entangled structure can be associated with a pure state of a multiqubit system. Moreover, we show that a pure state corresponding to a given entangled structure is a superposition of vectors from a subspace of the 2N-dimensional Hilbert space, whose dimension grows linearly with the number of entangled pairs.

12 September 2014 in Physical Review A
Verified
Journal Article
Closed access
PDF file
JBJan Bouda
Jan Bouda
Marcin PawłowskiMarcin Pawłowski
Marcin Pawłowski
MPMatej Pivoluska
Matej Pivoluska
MPMartin Plesch
Martin Plesch
Expansion and amplification of weak randomness play a crucial role in many security protocols. Using quantum devices, such procedure is possible even without trusting the devices used, by utilizing correlations between outcomes of parts of the devices. We show here how to extract random bits with an arbitrarily low bias from single arbitrarily weak min-entropy block source in a device independent setting. To do this we use Mermin devices that exhibit superclassical correlations. The number of devices used scales polynomially in the length of the random sequence n. Our protocol is robust; it can tolerate devices that malfunction with probability decreasing polynomially in n at the cost of minor increase in the number of devices used.