We consider how the energy cost of bit reset scales with the time duration of the protocol. Bit reset necessarily takes place in finite time, where there is an extra penalty on top of the quasistatic work cost derived by Landauer. This extra energy is dissipated as heat in the computer, inducing a fundamental limit on the speed of irreversible computers. We formulate a hardware-independent expression for this limit in the framework of stochastic processes. We derive a closed-form lower bound on the work penalty as a function of the time taken for the protocol and bit reset error. It holds for discrete as well as continuous systems, assuming only that the master equation respects detailed balance.

Uncertainty principle lies at the heart of quantum mechanics, while nonlocality is an intriguing phenomenon of quantum mechanics to rule out local causal theories. One subtle form of nonlocality is so-called Einstein-Podolsky-Rosen (EPR) steering, which holds the potential for shared entanglement verification even if the one-sided measurement device is untrusted. However, certifying EPR steering remains a big challenge presently. Here, we employ the local uncertainty relation to provide an experimental friendly approach for EPR steering verification. We show that the strength of EPR steering is quantitatively linked to the strength of the uncertainty relation, as well as the amount of entanglement. We find also that the realignment method works for detecting EPR steering of an arbitrary dimensional system.

Quantum cryptographic conferencing (QCC) holds promise for distributing information-theoretic secure keys among multiple users over a long distance. Limited by the fragility of Greenberger-Horne-Zeilinger (GHZ) states, QCC networks based on directly distributing GHZ states over a long distance still face a big challenge. Another two potential approaches are measurement device-independent QCC and conference-key agreement with single-photon interference, which were proposed on the basis of the postselection of GHZ states and the postselection of the W state, respectively. However, implementations of the former protocol are still heavily constrained by the transmission rate $\eta$ of optical channels and the complexity of the setups for postselecting GHZ states. Meanwhile, the latter protocol cannot be cast as a measurement device-independent prepare-and-measure scheme. Combining the idea of postselecting GHZ states and recently proposed twin-field quantum-key-distribution protocols, we report a QCC protocol based on weak coherent-state interferences named “phase-matching quantum cryptographic conferencing,” which is immune to all detector side-channel attacks. The proposed protocol can improve the key-generation rate from $O({\eta }^N)$ to $O({\eta }^{N-1})$ compared with the measurement device-independent QCC protocols. Meanwhile, it can be easily scaled up to multiple parties due to its simple setup.

Quantum pseudotelepathy is a strong form of nonlocality. Different from the conventional nonlocal games where quantum strategies win statistically, e.g., the Clauser-Horne-Shimony-Holt game, quantum pseudotelepathy in principle allows quantum players to with probability 1. In this Letter, we report a faithful experimental demonstration of quantum pseudotelepathy via playing the nonlocal version of Mermin-Peres magic square game, where Alice and Bob cooperatively fill in a $3\times 3$ magic square. We adopt the hyperentanglement scheme and prepare photon pairs entangled in both the polarization and the orbital angular momentum degrees of freedom, such that the experiment is carried out in a resource-efficient manner. Under the locality and fair-sampling assumption, our results show that quantum players can simultaneously win all the queries over any classical strategy.

Device-independent quantum key distribution (DIQKD) is information-theoretically secure against adversaries who possess a scalable quantum computer and who have supplied malicious key-establishment systems; however, the DIQKD key rate is currently too low. Consequently, we devise a DIQKD scheme based on the quantum nonlocal Mermin-Peres magic square game: our scheme asymptotically delivers DIQKD against collective attacks, even with noise. Our scheme outperforms DIQKD using the Clauser-Horne-Shimony-Holt game with respect to the number of game rounds, albeit not number of entangled pairs, provided that both state visibility and detection efficiency are high enough.

Hypergraph states, a generalization of graph states, constitute a large class of quantum states with intriguing nonlocal properties, and they have promising applications in quantum information science and technology. In this paper, we study some features of an independently proposed generalization of hypergraph states to qudit hypergraph states, i.e., each vertex in the generalized hypergraph (multi-hypergraph) represents a $d$-level system instead of a two-level one. It is shown that multi-hypergraphs and $d$-level hypergraph states have a one-to-one correspondence, and the structure of a multi-hypergraph exhibits the entanglement property of the corresponding quantum state. We discuss their relationship with some well-known state classes, e.g., real equally weighted states and stabilizer states. The Bell nonlocality, an important resource in fulfilling many quantum information tasks, is also investigated.