Marcin Pawlowski

Learn More
The reparametrization-invariant generating functional for the unitary and causal perturbation theory in general relativity in a finite space-time is obtained. The region of validity of the Faddeev-Popov-DeWitt functional is studied. It is shown that the invariant content of general relativity as a constrained system can be covered by two " equivalent "(More)
In this paper we design a protocol to extract random bits with an arbitrarily low bias from a single arbitrarily weak min-entropy block source in a device independent setting. The protocol employs Mermin devices that exhibit super-classical correlations. Number of devices used scales polynomially in the length of the block n, containing entropy of at least(More)
A model of quantum-von Neumann hybrid cellular automata: principles and simulation of quantum coherent superposition and dehoerence in cytoskeletal microtubules (1&2) 22 A. Ambainis (I), Exact quantum algorithms have advantage for almost all Boolean functions (5&6) 435 A. Ambainis (II), Spatial search on grids with minimum memory (13&14) 1233 A. Ambainis(More)
Semi-device-independent quantum protocols realize information tasks – e.g. secure key distribution, random access coding, and randomness generation – in a scenario where no assumption on the internal working of the devices used in the protocol is made, except their dimension. These protocols offer two main advantages: first, their implementation is often(More)
We discuss the application of the method of the gaugeless Hamiltonian reduction to general relativity. This method is based on explicit resolving the global part of the energy constraint and on identification of one of the metric components with the evolution parameter of the equivalent unconstrained (reduced) system. The Hamiltonian reduction reveals a(More)
We present a secure device-independent quantum key distribution scheme based on Hardy's paradox. In comparison with protocols based on Bell inequalities, it has several novel features: (a) The bits used for the secret key do not come from the results of the measurements on an entangled state but from the choices of settings which are harder for an(More)
Oblivious transfer (OT) is an important tool in cryptography. It serves as a subroutine to other complex procedures of both theoretical and practical significance. Common attribute of OT protocols is that one party (Alice) has to send a message to another party (Bob) and has to stay oblivious on whether Bob did receive the message. Specific (OT) protocols(More)
  • 1