A hybrid stabilization technique for simulating water wave - Structure interaction by incompressible Smoothed Particle Hydrodynamics (ISPH) method

The Smoothed Particle Hydrodynamics (SPH) method is emerging as a potential tool for studying water wave related problems, especially for violent free surface flow and large deformation problems. The incompressible SPH (ISPH) computations have been found not to be able to maintain the stability in certain situations and there exist some spurious oscillations in the pressure time history, which is similar to the weakly compressible SPH (WCSPH). One main cause of this problem is related to the non-uniform and clustered distribution of the moving particles. In order to improve the model performance, the paper proposed an efficient hybrid numerical technique aiming to correct the ill particle distributions. The correction approach is realized through the combination of particle shifting and pressure gradient improvement. The advantages of the proposed hybrid technique in improving ISPH calculations are demonstrated through several applications that include solitary wave impact on a slope or overtopping a seawall, and regular wave slamming on the subface of open-piled structure

Semidefinite programming converse bounds for classical communication over quantum channels

© 2017 IEEE. We study the classical communication over quantum channels when assisted by no-signalling (NS) and PPT-preserving (PPT) codes. We first show that both the optimal success probability of a given transmission rate and one-shot-error capacity can be formalized as semidefinite programs (SDPs) when assisted by NS or NS∩PPT codes. Based on this, we derive SDP finite blocklength converse bounds for general quantum channels, which also reduce to the converse bound of Polyanskiy, Poor, and Verdii for classical channels. Furthermore, we derive an SDP strong converse bound for the classical capacity of a general quantum channel: for any code with a rate exceeding this bound, the optimal success probability vanishes exponentially fast as the number of channel uses increases. In particular, applying our efficiently computable bound, we derive improved upper bounds to the classical capacity of the amplitude damping channels and also establish the strong converse property for a new class of quantum channels

Semidefinite programming strong converse bounds for classical capacity

© 2017 IEEE. We investigate the classical communication over quantum channels when assisted by no-signaling and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the one-shot -error capacity are formalized as semidefinite programs (SDPs). Based on this, we obtain improved SDP finite blocklength converse bounds of general quantum channels for entanglement-assisted codes and unassisted codes. Furthermore, we derive two SDP strong converse bounds for the classical capacity of general quantum channels: for any code with a rate exceeding either of the two bounds of the channel, the success probability vanishes exponentially fast as the number of channel uses increases. In particular, applying our efficiently computable bounds, we derive an improved upper bound on the classical capacity of the amplitude damping channel. We also establish the strong converse property for the classical and private capacities of a new class of quantum channels. We finally study the zero-error setting and provide efficiently computable upper bounds on the one-shot zero-error capacity of a general quantum channel

Approximate broadcasting of quantum correlations

© 2017 American Physical Society. Broadcasting quantum and classical information is a basic task in quantum information processing, and is also a useful model in the study of quantum correlations including quantum discord. We establish a full operational characterization of two-sided quantum discord in terms of bilocal broadcasting of quantum correlations. Moreover, we show that both the optimal fidelity of unilocal broadcasting of the correlations in an arbitrary bipartite quantum state and that of broadcasting an arbitrary set of quantum states can be formulized as semidefinite programs (SDPs), which are efficiently computable. We also analyze some properties of these SDPs and evaluate the broadcasting fidelities for some cases of interest