



@article {2251,
	title = {Multiparty quantum data hiding with enhanced security and remote deletion},
	year = {2018},
	pages = {5},
	abstract = {<p>One of the applications of quantum technology is to use quantum states and measurements to communicate which offers more reliable security promises. Quantum data hiding, which gives the source party the ability of sharing data among multiple receivers and revealing it at a later time depending on his/her will, is one of the promising information sharing schemes which may address practical security issues. In this work, we propose a novel quantum data hiding protocol. By concatenating different subprotocols which apply to rather symmetric hiding scenarios, we cover a variety of more general hiding scenarios. We provide the general requirements for constructing such protocols and give explicit examples of encoding states for five parties. We also proved the security of the protocol in sense that the achievable information by unauthorized operations asymptotically goes to zero. In addition, due to the capability of the sender to manipulate his/her subsystem, the sender is able to abort the protocol remotely at any time before he/she reveals the information.</p>},
	url = {https://arxiv.org/abs/1804.01982},
	author = {Xingyao Wu and Jianxin Chen}
}
@article {1440,
	title = {The Minimum Size of Unextendible Product Bases in the Bipartite Case  (and Some Multipartite Cases)
},
	journal = {Communications in Mathematical Physics},
	volume = {333},
	year = {2015},
	month = {2014/10/10},
	pages = {351 - 365},
	abstract = {  A long-standing open question asks for the minimum number of vectors needed
to form an unextendible product basis in a given bipartite or multipartite
Hilbert space. A partial solution was found by Alon and Lovasz in 2001, but
since then only a few other cases have been solved. We solve all remaining
bipartite cases, as well as a large family of multipartite cases.
},
	doi = {10.1007/s00220-014-2186-7},
	url = {http://arxiv.org/abs/1301.1406v1},
	author = {Jianxin Chen and Nathaniel Johnston}
}
@article {1449,
	title = {Minimum Entangling Power is Close to Its Maximum},
	year = {2012},
	month = {2012/10/04},
	abstract = {  Given a quantum gate $U$ acting on a bipartite quantum system, its maximum
(average, minimum) entangling power is the maximum (average, minimum)
entanglement generation with respect to certain entanglement measure when the
inputs are restricted to be product states. In this paper, we mainly focus on
the {\textquoteright}weakest{\textquoteright} one, i.e., the minimum entangling power, among all these
entangling powers. We show that, by choosing von Neumann entropy of reduced
density operator or Schmidt rank as entanglement measure, even the {\textquoteright}weakest{\textquoteright}
entangling power is generically very close to its maximal possible entanglement
generation. In other words, maximum, average and minimum entangling powers are
generically close. We then study minimum entangling power with respect to other
Lipschitiz-continuous entanglement measures and generalize our results to
multipartite quantum systems.
  As a straightforward application, a random quantum gate will almost surely be
an intrinsically fault-tolerant entangling device that will always transform
every low-entangled state to near-maximally entangled state.
},
	url = {http://arxiv.org/abs/1210.1296v1},
	author = {Jianxin Chen and Zhengfeng Ji and David W Kribs and Bei Zeng}
}
