相关论文: Counterfactual Computation
Due to the increasing use of machine learning in practice it becomes more and more important to be able to explain the prediction and behavior of machine learning models. An instance of explanations are counterfactual explanations which…
Counterfactual quantum communication is one of the most interesting facets of quantum communication, allowing two parties to communicate without any transmission of quantum or classical particles between the parties involved in the…
As one of the most intriguing intrinsic properties of quantum world, quantum superposition provokes great interests in its own generation. Oszmaniec [Phys. Rev. Lett. 116, 110403 (2016)] have proven that though a universal quantum machine…
Quantum computation is a novel way of information processing which allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit and…
Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties of realizing quantum…
In spite of their evident logical character, particle statistics symmetries are not among the inherently quantum features exploited in quantum computation. A difficulty may be that, being a constant of motion of a unitary evolution, a…
We demonstrate quantum information can be transferred between two distant participants without any physical particles travelling between them. The key procedure of the counterfactual scheme is to entangle two nonlocal qubits with each other…
Quantum computers, besides offering substantial computational speedups, are also expected to provide the possibility of preserving the privacy of a computation. Here we show the first such experimental demonstration of blind quantum…
With the advent of delegated quantum computing as a service, verifying quantum computations is becoming a question of great importance. Existing information theoretically Secure Delegated Quantum Computing (SDQC) protocols require the…
It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum…
With the great success in simulating many intelligent behaviors using computing devices, there has been an ongoing debate whether all conscious activities are computational processes. In this paper, the answer to this question is shown to…
As machine learning is increasingly used to inform consequential decision-making (e.g., pre-trial bail and loan approval), it becomes important to explain how the system arrived at its decision, and also suggest actions to achieve a…
We propose a framework of bit commitment protocol using a comparison scheme and present a compound comparison scheme based on counterfactual cryptography. Finally, we propose a counterfactual quantum bit commitment protocol. In security…
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate…
Machine learning plays a role in many deployed decision systems, often in ways that are difficult or impossible to understand by human stakeholders. Explaining, in a human-understandable way, the relationship between the input and output of…
Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that…
Superposition, arguably the most fundamental property of quantum mechanics, lies at the heart of quantum information science. However, how to create the superposition of any two unknown pure states remains as a daunting challenge. Recently,…
In the present article we use the quantum formalism to describe the process of choice under rational ignorance. We consider as a basic task a question or an issue where the only answers are 0 and 1. We show that under rational ignorance the…
Quantum computation teaches us that quantum mechanics exhibits exponential complexity. We argue that the standard scientific paradigm of "predict and verify" cannot be applied to testing quantum mechanics in this limit of high complexity.…
Quantum technology has the potential to revolutionize how we acquire and process experimental data to learn about the physical world. An experimental setup that transduces data from a physical system to a stable quantum memory, and…