Change log

From QETLAB
Revision as of 18:58, 12 January 2016 by Nathaniel (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

This page contains a detailed list of changes between the different versions of QETLAB.

Changes in v0.9 (January 12, 2016)

New functions

  • BCSGameLB: Computes a lower bound on the quantum value of a binary constraint system (BCS) game.
  • BCSGameValue: Computes the maximum value of a binary constraint system (BCS) game. In classical and no-signalling settings, the value computed is exact, but the quantum value is just an upper bound.
  • InducedMatrixNorm: Computes a lower bound on the induced p->q norm of a matrix.
  • InducedSchattenNorm: Computes a lower bound on the induced Schatten p->q norm of a superoperator.
  • L1NormCoherence: Computes the ℓ1-norm of coherence of a quantum state.
  • NonlocalGameLB: Computes a lower bound on the quantum value of a two-player non-local game.
  • RandomPOVM: Computes a random POVM of a specified size and with a specified number of outcomes.
  • RelEntCoherence: Computes the relative entropy of coherence of a quantum state.
  • RobustnessCoherence: Computes the robustness of coherence of a quantum state.
  • TraceDistanceCoherence: Computes the trace distance of coherence of a quantum state.
  • helpers/bcs_to_nonlocal: Converts a description of a binary constraint system (BCS) game into a form that can be presented as a general non-local game.
  • helpers/pure_to_mixed: Converts a state vector or density matrix representation of a state to a density matrix.

Changes to existing functions

  • Entropy: Fixed a bug that would cause NaN output for some low-rank input states.
  • kpNorm: Can now be used as the objective function or as a constraint in a CVX optimization problem, regardless of k and p (only certain special values of k and p were supported previously).
  • kpNormDual: Can now be used as the objective function or as a constraint in a CVX optimization problem, regardless of k and p (only certain special values of k and p were supported previously).
  • NonlocalGameValue: Added the REPT optional input argument, which lets the user specify the number of times that the non-local game will be repeated in parallel.
  • SchattenNorm: Can now be used as the objective function or as a constraint in a CVX optimization problem, regardless of p (only p = 1, p = 2, and p = Inf were supported previously).

Changes in v0.8 (April 13, 2015)

New functions

  • BellInequalityMaxQubits: Approximates the optimal value of a Bell inequality in qubit (i.e., 2-dimensional quantum) settings.
  • NonlocalGameValue: Computes the maximum value of a nonlocal game in a classical, quantum, or no-signalling setting.

Changes to existing functions

  • BellInequalityMax: Bug fix when computing the classical value of a Bell inequality using measurements that have values other than $0, 1, 2, \ldots, d-1$.
  • KrausOperators: If the zero map is provided as input, this function now returns a single zero matrix Kraus operator, rather than an empty cell containing no Kraus operators.
  • XORGameValue: Bug fix when computing the value of some XOR games with complex entries.

Changes in v0.7 (January 22, 2015)

New functions

  • BellInequalityMax: Computes the maximum value of a Bell inequality in a classical, quantum, or no-signalling setting.
  • BreuerState: Generates a Breuer state, which is a specific family of bound entangled states on even local dimensions.
  • DephasingChannel: Produces a (completely or partially) dephasing channel.
  • DickeState: Generates a Dicke state.
  • GHZState: Generates a (generalized) GHZ state.
  • GisinState: Generates a 2-qubit Gisin state.
  • HorodeckiState: Generates a Horodecki state, which is a specific family of bound entangled states in (3 \otimes 3)- and (2 \otimes 4)-dimensional spaces.
  • LocalDistinguishability: Computes the maximum probability of distinguishing quantum states by means of symmetric-extendible measurements.
  • NPAHierarchy: Determines whether or not a set of probabilities satisfy the conditions of the NPA hierarchy, which is a necessary condition for the probabilities to arise from quantum mechanics.
  • PauliChannel: Generates a Pauli channel (i.e., a quantum channel with Kraus operators that are multiples of Pauli operators).
  • RandomProbabilities: Computes a random probability vector, distributed uniformly on the unit simplex.
  • WState: Generates a (generalized) W-state.
  • XORGameValue: Computes the classical or quantum value of a nonlocal XOR game (replaces the old functions XORClassicalValue and XORQuantumValue).
  • helpers/unique_perms: Computes all distinct permutations of a given vector (the same as unique(perms(V),'rows'), but typically faster and less memory-intensive).
  • helpers/update_odometer: Increases the entries of a vector subject to constraints on how large the entries of that vector can be. Useful when you want to have k nested for loops, but k isn't specified beforehand.

Changes to existing functions

  • AbsPPTConstraints: The DIM input argument is now optional, and the LAM input argument can now either be a vector of eigenvalues or a density matrix (it had to be a vector of eigenvalues before).
  • IsAbsPPT: Can now be used directly as a constraint or objective function within other CVX optimization problems.
  • IsPPT: Can now be used directly as a constraint or objective function within other CVX optimization problems.
  • IsPSD: Can now be used directly as a constraint or objective function within other CVX optimization problems.
  • SymmetricExtension: Can now be used directly as a constraint or objective function within other CVX optimization problems.
  • SymmetricInnerExtension: Can now be used directly as a constraint or objective function within other CVX optimization problems.
  • TensorSum: Is now much faster at tensoring together lots (> 20) of sparse vectors.

Removed functions

Changes in v0.6 (November 27, 2014)

New functions

  • AbsPPTConstraints: Computes the linear matrix inequalities that determine whether or not a mixed state is "absolutely PPT".
  • Fidelity: Computes the fidelity of two quantum states, or allows the user to optimize over the fidelity of two quantum states in CVX.
  • InSeparableBall: Determines whether or not a given mixed state is within the ball of separability centered at the maximally-mixed state.
  • IsAbsPPT: Determines whether or not a mixed state is "absolutely PPT".
  • MaximumOutputFidelity: Computes the maximum output fidelity of two quantum channels.
  • XORClassicalValue: Computes the classical value of a two-player nonlocal XOR game.
  • helpers/superoperator_dims: Computes the input, output, and environment dimensions of a superoperator. Introduced in order to clean up the code in many other functions.

Changes to existing functions

  • BrauerStates: Reversed the order of the input arguments D and P.
  • CBNorm and DiamondNorm: Updated the script so that it can now also be used in the objective function or constraints of other CVX optimization problems (so you can minimize the diamond norm of all channels satisfying a given linear constraint, for example).
  • Entropy: Now has a second optional input argument, ALPHA, which allows the user to compute arbitrary Renyi entropies, rather than just the usual von Neumann entropy.
  • Pauli: Now allows the user to request a several-qubit Pauli operator, rather than just a 1-qubit Pauli operator. Also, this function now returns output that is sparse by default, rather than full.
  • Swap and SwapOperator: Reversed the order of the SYS and DIM optional input arguments.
  • Twirl: Can now also perform Pauli twirls.

Changes in v0.5 (November 6, 2014)

No changes: this was the initial public release of QETLAB.