```python
import heapq

def heap_queue_smallest(nums, n):
  """
  Finds the n smallest integers from a list of numbers using the heap queue algorithm.

  Args:
    nums: A list of numbers.
    n: The number of smallest integers to find.

  Returns:
    A list containing the n smallest integers from nums.
  """
  return heapq.nsmallest(n, nums)
```